• DocumentCode
    3122801
  • Title

    The supermarket game

  • Author

    Xu, Jiaming ; Hajek, Bruce

  • Author_Institution
    Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    2511
  • Lastpage
    2515
  • Abstract
    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.
  • Keywords
    costing; customer services; game theory; queueing theory; sampling methods; stochastic processes; FCFS queues; Nash equilibrium; expected total cost; finite model; fixed symmetric customer strategy; global Poisson arrival rate; joint equilibrium distribution; mean field model; product distribution; sampling; supermarket game; unit exponential service rate; waiting; Games; Load management; Load modeling; Mathematical model; Nash equilibrium; Queueing analysis; Servers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6283969
  • Filename
    6283969