The Supermarket Game

References

• Alanyali, M. and Dashouk, M. (2011). Occupancy distributions of homogeneous queueing systems under opportunistic scheduling. IEEE Transactions on Information Theory 57, 1 (Jan.), 256–266. MR2810282Google Scholar
• Bordenave, C., McDonald, D., and Proutiere, A. (2010). A particle system in interaction with a rapidly varying environment: Mean field limits and applications. Journal on Networks and Heterogeneous Media 5, 31–62. MR2601988Google Scholar
• Bramson, M., Lu, Y., and Prabhakar, B. (2010). Randomized load balancing with general service time distributions. In Proceedings of the ACM SIGMETRICS 2010. New York, NY, USA, 275–286.Google Scholar
• Deimling, K. (1977). Ordinary Differential Equations in Banach Spaces. Vol. 96. Springer. MR0463601Google Scholar
• Ganesh, A., Lilienthal, S., Manjunath, D., Proutiere, A., and Simatos, F. (2010). Load balancing via random local search in closed and open systems. SIGMETRICS Perform. Eval. Rev. 38, 287–298.Google Scholar
• Graham, C. (2000). Chaoticity on path space for a queueing network with selection of the shortest queue among several. J. Appl. Probab. 37, 198–211. MR1761670Google Scholar
• Hassin, R. and Haviv, M. (1994). Equilibrium strategies and the value of informaiton in a two line queueing system with threshold jockeying. Commun. Statist. Stochastic Models 10(2), 415–435. MR1268559Google Scholar
• Hassin, R. and Haviv, M. (2003). To queue or not to queue: equilibrium behavior in queueing systems. International series in Operations Research and Management Science, Springer. MR2006433Google Scholar
• Hassin, R. and Roet-Green, R. Equilibrium in a two dimensional queueing game: When inspecting the queue is costly. preprint (Dec. 2012), available at http://www.math.tau.ac.il/~hassin/ricky.pdf.Google Scholar
• Huang, M., Caines, P., and Malhame, R. (2007). Large-population cost-coupled LQG problems with nonuniform agents: Individual-mass behavior and decentralized ε-Nash equilibria. IEEE Transactions on Automatic Control 52, 9 (Sept.), 1560–1571. MR2352434Google Scholar
• Kingman, J. (1966). Two similar queues in parallel. Annals of Mathematical Statistics 32, 1314–1323. MR0144394Google Scholar
• Lasry, J. M. and Lions, P. L. (2007). Mean field games. Japanese Journal of Mathematics, 229–260. MR2295621Google Scholar
• Luczak, M. and McDiarmid, C. (2006). On the maximum queue length in the supermarket model. Ann. Probab. 34, 493–527. MR2223949Google Scholar
• Mitzenmacher, M. (1996). The power of two choices in randomized load balancing. Ph.D. thesis, Univ. of California, Berkeley. MR2695522Google Scholar
• Mitzenmacher, M. (2001). The power of two choices in randomized load balancing. IEEE Trans. on Parallel and Distributed Systems 12:10, 1094–1104.Google Scholar
• Sznitman, A. (1991). Topics in propagation of chaos. In Springer Verlag Lecture Notes in Mathematics 1464, P. Hennequin, Ed. Springer-Verlag, 165–251. MR1108185Google Scholar
• Tsitsiklis, J. N. and Xu, K. (2011). On the power of (even a little) centralization in distributed processing. SIGMETRICS Perform. Eval. Rev. 39, 121–132.Google Scholar
• Tsitsiklis, J. N. and Xu, K. (2012). On the power of (even a little) resource pooling. Stochastic Systems 2, 1–66. MR2960735Link, Google Scholar
• Turner, S. (1998). The effect of increasing routing choice on resource pooling. Prob. Eng. Inf. Sci. 12, 109–123. MR1492143Google Scholar
• Vvedenskaya, N. D., Dobrushin, R. L., and Karpelevich, F. I. (1996). Queueing system with selection of the shortest of two queues: An asymptotic approach. Prob. Inf. Trans 32, 15–27. MR1384927Google Scholar