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 条
  • [21] Incentive Compatible Configuration for Wireless Multicast: A Game Theoretic Approach
    Tsuo, Fu-Yun
    Huang, Jen-Ping
    Ko, Chun-Han
    Wei, Hung-Yu
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2011, 60 (07) : 3520 - 3525
  • [22] Designing Fast Converging Cost Sharing Methods for Multicast Transmissions
    Vittorio Bilò
    Angelo Fanelli
    Michele Flammini
    Giovanna Melideo
    Luca Moscardelli
    Theory of Computing Systems, 2010, 47 : 507 - 530
  • [23] When ignorance helps: Graphical multicast cost sharing games
    Bilo, Vittorio
    Fanelli, Angelo
    Flammini, Michele
    Moscardelli, Luca
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (03) : 660 - 671
  • [24] Faithful distributed shapley mechanisms for sharing the cost of multicast transmissions
    Garg, Nandan
    Grosu, Daniel
    2007 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1-3, 2007, : 969 - 975
  • [25] Designing Fast Converging Cost Sharing Methods for Multicast Transmissions
    Bilo, Vittorio
    Fanelli, Angelo
    Flammini, Michele
    Melideo, Giovanna
    Moscardelli, Luca
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (02) : 507 - 530
  • [26] On Cost Sharing Mechanisms in the Network Design Game
    Awerbuch, Baruch
    Khandekar, Rohit
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 364 - 365
  • [27] When ignorance helps:: Graphical multicast cost sharing games
    Bilo, Vittorio
    Fanelli, Angelo
    Flammini, Michele
    Moscardelli, Luca
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 108 - +
  • [28] An Efficient Resource Sharing and Multicast Scheduling for Video over Wireless Networks
    Kalaiselvi, P.
    Mahendran, N.
    2013 IEEE INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN COMPUTING, COMMUNICATION AND NANOTECHNOLOGY (ICE-CCN'13), 2013, : 378 - 383
  • [29] Dynamic self-adaptive multicast in wireless networks
    Cai, K
    Lin, HZ
    Qiu, G
    INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOL 1-4, PROCEEDINGS, 2005, : 2200 - 2205
  • [30] Dynamic scheduling for wireless multicast in massive MIMO HetNet
    Zhang, Xinran
    Sun, Songlin
    PHYSICAL COMMUNICATION, 2018, 27 : 1 - 6