Wireless Multicast Cost Sharing Game with a Dynamic Population

被引:0
|
作者
Panda, Manoj [1 ]
Chahed, Tijani [1 ]
Altman, Eitan [2 ]
机构
[1] Telecom SudParis, 9 Rue Charles Fourier, F-91011 Evry, France
[2] INRIA, F-06902 Sophia Antipolis, France
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we study a wireless multicast cost sharing game where the population of users is dynamically changing due to random arrivals and departures. Each user can either subscribe to a dedicated (wired or wireless) connection of fixed cost or join a multicast session served by a wireless Base Station (BS). In the latter case, the instantaneous cost of transmission at any time is shared among the users that are present in the multicast session at that time. Each user, being selfish, chooses one of the two options so as to minimize its own share of cost. We characterize the symmetric equilibria with several information availability structures. With only distributional information, we obtain the probability with which a random user would join the multicast session under the Highest Cost Allocation (HCA), the Incremental Cost Allocation (ICA) and the Shapley Value Allocation (SVA) schemes. We observe that, if the the number of users in the session is made available to the users, then the equilibrium strategy of the users is to join the multicast session when at least one other user is already present and to randomize only when there is none.
引用
收藏
页码:58 / 63
页数:6
相关论文
共 50 条
  • [1] Sharing the cost of multicast transmissions in wireless networks
    Penna, P
    Ventre, C
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDING, 2004, 3104 : 255 - 266
  • [2] Sharing the cost of multicast transmissions in wireless networks
    Bilo, V.
    Flammini, M.
    Melideo, G.
    Moscardelli, L.
    Navarra, A.
    THEORETICAL COMPUTER SCIENCE, 2006, 369 (1-3) : 269 - 284
  • [3] Sharing the cost of multicast transmissions
    Feigenbaum, J
    Papadimitriou, CH
    Shenker, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (01) : 21 - 41
  • [4] Hardness results for multicast cost sharing
    Feigenbaum, J
    Krishnamurthy, A
    Sami, R
    Shenker, S
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 215 - 236
  • [5] Online Multicast with Egalitarian Cost Sharing
    Charikar, Moses
    Karloff, Howard
    Mathieu, Claire
    Naor, Joseph
    Saks, Michael
    SPAA'08: PROCEEDINGS OF THE TWENTIETH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2008, : 70 - +
  • [6] Approximation and collusion in multicast cost sharing
    Archer, A
    Feigenbaum, J
    Krishnamurthy, A
    Sami, R
    Shenker, S
    GAMES AND ECONOMIC BEHAVIOR, 2004, 47 (01) : 36 - 71
  • [7] A Dynamic Colonel Blotto Game Model for Spectrum Sharing in Wireless Networks
    Hajimirsaadeghi, Mohammad
    Mandayam, Narayan B.
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 287 - 294
  • [8] Sharing the `cost' of multicast trees: An axiomatic analysis
    Herzog, Shai
    Estrin, Deborah
    Shenker, Scott
    Computer Communications Review, 1995, 25 (04):
  • [9] Sharing the "cost" of multicast trees: An axiomatic analysis
    Herzog, S
    Shenker, S
    Estrin, D
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (06) : 847 - 860
  • [10] Performance evaluation of multicast cost sharing mechanisms
    Garg, Nandan
    Grosu, Daniel
    21ST INTERNATIONAL CONFERENCE ON ADVANCED NETWORKING AND APPLICATIONS, PROCEEDINGS, 2007, : 901 - +