The supermarket game

A supermarket game is considered with N FCFS queues with unit exponential service rate and global Poisson arrival rate Nλ. Upon arrival each customer chooses a number of queues to be sampled uniformly at random and joins the least loaded sampled queue. Customers are assumed to have cost for both waiting and sampling, and they want to minimize their own expected total cost. We study the supermarket game in a mean field model that corresponds to the limit as N converges to infinity in the sense that (i) for a fixed symmetric customer strategy, the joint equilibrium distribution of any fixed number of queues converges as N → ∞ to a product distribution determined by the mean field model and (ii) a Nash equilibrium for the mean field model is an e-Nash equilibrium for the finite N model with N sufficiently large. It is shown that there always exists a Nash equilibrium for λ <; 1 and the Nash equilibrium is unique for λ2 ≤ 1/2. Furthermore, we find that the action of sampling more queues by some customers has a positive externality on the other customers.

[1]  Refael Hassin,et al.  To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[2]  K. Deimling.  Ordinary differential equations in Banach spaces , 1977 .

[3]  Yi Lu,et al.  Randomized load balancing with general service time distributions , 2010, SIGMETRICS '10.

[4]  Refael Hassin,et al.  Equilibrium in a two dimensional queueing game: When inspecting the queue is costly , 2011 .

[5]  C. Graham.  Chaoticity on path space for a queueing network with selection of the shortest queue among several , 2000, Journal of Applied Probability.

[6]  P. Lions,et al.  Mean field games , 2007 .

[7]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[8]  R. L. Dobrushin,et al.  Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .

[9]  A. Sznitman.  Topics in propagation of chaos , 1991 .

[10]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[11]  S. Turner,et al.  The Effect of Increasing Routing Choice on Resource Pooling , 1998, Probability in the Engineering and Informational Sciences.

[12]  D. Manjunath,et al.  Load balancing via random local search in closed and open systems , 2010, SIGMETRICS '10.

[13]  John N. Tsitsiklis,et al.  On the power of (even a little) centralization in distributed processing , 2011, SIGMETRICS '11.

[14]  Minyi Huang,et al.  Large-Population Cost-Coupled LQG Problems With Nonuniform Agents: Individual-Mass Behavior and Decentralized $\varepsilon$-Nash Equilibria , 2007, IEEE Transactions on Automatic Control.

[15]  Murat Alanyali,et al.  Occupancy Distributions of Homogeneous Queueing Systems Under Opportunistic Scheduling , 2008, IEEE Transactions on Information Theory.

[16]  Refael Hassin,et al.  Equilibrium strategies and the value of information in a two line queueing system with threshold jockeying , 1994 .

[17]  John N. Tsitsiklis,et al.  On the Power of (Even a Little) Resource Pooling , 2012 .

[18]  Alexandre Proutière,et al.  A particle system in interaction with a rapidly varying environment: Mean field limits and applications , 2010, Networks Heterog. Media.

[19]  Bruce Hajek,et al.  The Supermarket Game , 2013 .

[20]  J. Kingman.  Two Similar Queues in Parallel , 1961 .

[21]  Colin McDiarmid,et al.  On the maximum queue length in the supermarket model , 2004 .