Mean-Field Game Approach to Admission Control of an M/M/∞ Queue with Shared Service Cost

Piotr Wiecek (1) , Eitan Altman (2) , Arnob Ghosh (3)

1 IMCS - Institute of Mathematics and Computer Science [Wroclaw]
2 MAESTRO - Models for the performance analysis and the control of networks
3 University of Pennsylvania

We study a mean field approximation of the M/M/$\infty$ queueing system. The problem we deal is quite different from standard games of congestion as we consider the case in which higher congestion results in smaller costs per user. This is motivated by a situation in which some TV show is broadcast so that the same cost is needed no matter how many users follow the show. Using a mean-field approximation, we show that this results in multiple equilibria of threshold type which we explicitly compute. We further derive the social optimal policy and compute the price of anarchy. We then study the game with partial information and show that by appropriate limitation of the queue-state information obtained by the players we can obtain the same performance as when all the information is available to the players. We show that the mean-field approximation becomes tight as the workload increases, thus the results obtained for the mean-field model well approximate the discrete one.

Domaines: Réseaux et télécommunications [cs.NI]; Informatique

Piotr Wiecek, Eitan Altman, Arnob Ghosh. Mean-Field Game Approach to Admission Control of an M/M/∞ Queue with Shared Service Cost. Dynamic Games and Applications, 2015, pp.1-29. ⟨10.1007/s13235-015-0168-9⟩. ⟨hal-01260958⟩