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.
[1]
G. Owen,et al.
A Simple Expression for the Shapley Value in a Special Case
,
1973
.
[2]
Ronald W. Wolff,et al.
Poisson Arrivals See Time Averages
,
1982,
Oper. Res..
[3]
Bernardo D'Auria.
The M/M/∞ Queue
,
2011
.
[4]
T. Collings,et al.
The M/M/∞ Queue with Varying Arrival and Departure Rates
,
1976,
Oper. Res..
[5]
Louis Anthony Cox,et al.
Wiley encyclopedia of operations research and management science
,
2011
.
[6]
R. R. P. Jackson,et al.
Elements of Queueing Theory with Applications
,
1962
.
[7]
Eitan Altman,et al.
The wireless multicast coalition game and the non-cooperative association problem
,
2011,
2011 Proceedings IEEE INFOCOM.
[8]
William Thomson,et al.
Cost allocation and airport problems
,
2007
.