IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v63y2015i1p247-259.html
   My bibliography  Save this article

Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game

Author

Listed:
  • Harsha Honnappa

    (School of Industrial Engineering, Purdue University, West Lafayette IN 47906)

  • Rahul Jain

    (Department of Electrical Engineering and Department of Information and Systems Engineering, University of Southern California, Los Angeles, California 90089)

Abstract

Queueing networks models typically assume that the arrival process is exogenous and unaffected by admission control, scheduling policies, etc. In many situations, however, users choose the time of their arrival strategically, taking delay and other metrics into account. In this paper, we develop a framework to study such strategic arrivals into queueing networks. We study the population game wherein users strategically choose when to arrive at a parallel queueing network and upon arrival, which of the queues to join. The queues start service at given times, which can potentially be different. We characterize the (strategic) arrival process at each of the queues and the price of anarchy of the ensuing strategic arrival game. We then extend the analysis to multiple populations of users, each with a different cost metric. The equilibrium arrival profile and price of anarchy are derived. Finally, we extend this to general feedforward network architectures by modeling the arrival timing game as a two-stage extensive form game. We prove the existence and essential uniqueness of equilibria. We also study more specific network topologies, like tandem and trellis networks, and we derive the equilibrium arrival and routing profiles. We show that there exists an equivalent parallel queueing network that has the same equilibrium arrival profile. Thus, the price of anarchy of the arrival game is then implied by that of the parallel queueing network.

Suggested Citation

  • Harsha Honnappa & Rahul Jain, 2015. "Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game," Operations Research, INFORMS, vol. 63(1), pages 247-259, February.
  • Handle: RePEc:inm:oropre:v:63:y:2015:i:1:p:247-259
    DOI: 10.1287/opre.2014.1338
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2014.1338
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2014.1338?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Robin Lindsey, 2004. "Existence, Uniqueness, and Trip Cost Function Properties of User Equilibrium in the Bottleneck Model with Multiple User Classes," Transportation Science, INFORMS, vol. 38(3), pages 293-314, August.
    2. Nisan,Noam & Roughgarden,Tim & Tardos,Eva & Vazirani,Vijay V. (ed.), 2007. "Algorithmic Game Theory," Cambridge Books, Cambridge University Press, number 9780521872829, October.
    3. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    4. Martin A. Lariviere & Jan A. Van Mieghem, 2004. "Strategically Seeking Service: How Competition Can Generate Poisson Arrivals," Manufacturing & Service Operations Management, INFORMS, vol. 6(1), pages 23-40, January.
    5. Glazer, Amihai & Hassin, Refael, 1983. "?/M/1: On the equilibrium distribution of customer arrivals," European Journal of Operational Research, Elsevier, vol. 13(2), pages 146-150, June.
    6. Khan, M. Ali & Sun, Yeneng, 2002. "Non-cooperative games with many players," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 46, pages 1761-1808, Elsevier.
    7. Haim Mendelson & Seungjin Whang, 1990. "Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue," Operations Research, INFORMS, vol. 38(5), pages 870-883, October.
    8. SCHMEIDLER, David, 1973. "Equilibrium points of nonatomic games," LIDAM Reprints CORE 146, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Sachin Adlakha & Ramesh Johari, 2013. "Mean Field Equilibrium in Dynamic Games with Strategic Complementarities," Operations Research, INFORMS, vol. 61(4), pages 971-989, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Haiyan & Olsen, Tava Lennon & Shalpegin, Timofey, 2022. "Demand Postponement with Strategic Service Customers," Omega, Elsevier, vol. 107(C).
    2. Liron Ravner & Yutaka Sakuma, 2021. "Strategic arrivals to a queue with service rate uncertainty," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 303-341, April.
    3. Chamberlain, Jonathan & Simhon, Eran & Starobinski, David, 2021. "Preemptible queues with advance reservations: Strategic behavior and revenue management," European Journal of Operational Research, Elsevier, vol. 293(2), pages 561-578.
    4. Tzvi Alon & Moshe Haviv, 2023. "Choosing a batch to be processed," Annals of Operations Research, Springer, vol. 326(1), pages 67-87, July.
    5. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.
    6. Moshe Haviv & Liron Ravner, 2021. "A survey of queueing systems with strategic timing of arrivals," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 163-198, October.
    7. Shu Zhang & Jeffrey W. Ohlmann & Barrett W. Thomas, 2018. "Dynamic Orienteering on a Network of Queues," Transportation Science, INFORMS, vol. 52(3), pages 691-706, June.
    8. Gianmarco Bet & Remco van der Hofstad & Johan S. H. van Leeuwaarden, 2019. "Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 821-864, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Balaraman Rajan & Tolga Tezcan & Abraham Seidmann, 2019. "Service Systems with Heterogeneous Customers: Investigating the Effect of Telemedicine on Chronic Care," Management Science, INFORMS, vol. 65(3), pages 1236-1267, March.
    2. Platz, Trine Tornøe & Østerdal, Lars Peter, 2017. "The curse of the first-in–first-out queue discipline," Games and Economic Behavior, Elsevier, vol. 104(C), pages 165-176.
    3. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    4. de Palma, André & Fosgerau, Mogens, 2013. "Random queues and risk averse users," European Journal of Operational Research, Elsevier, vol. 230(2), pages 313-320.
    5. Moshe Haviv & Liron Ravner, 2021. "A survey of queueing systems with strategic timing of arrivals," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 163-198, October.
    6. Jian Yang, 2017. "A link between sequential semi-anonymous nonatomic games and their large finite counterparts," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(2), pages 383-433, May.
    7. Nicos Savva & Tolga Tezcan & Özlem Yıldız, 2019. "Can Yardstick Competition Reduce Waiting Times?," Management Science, INFORMS, vol. 65(7), pages 3196-3215, July.
    8. Philipp Afèche & Opher Baron & Joseph Milner & Ricky Roet-Green, 2019. "Pricing and Prioritizing Time-Sensitive Customers with Heterogeneous Demand Rates," Operations Research, INFORMS, vol. 67(4), pages 1184-1208, July.
    9. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
    10. Camacho, Carmen & Kamihigashi, Takashi & Sağlam, Çağrı, 2018. "Robust comparative statics for non-monotone shocks in large aggregative games," Journal of Economic Theory, Elsevier, vol. 174(C), pages 288-299.
    11. Robert M. Anderson & Haosui Duanmu & M. Ali Khan & Metin Uyanik, 2022. "Walrasian equilibrium theory with and without free-disposal: theorems and counterexamples in an infinite-agent context," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 73(2), pages 387-412, April.
    12. Qiuping Yu & Gad Allon & Achal Bassamboo & Seyed Iravani, 2018. "Managing Customer Expectations and Priorities in Service Systems," Management Science, INFORMS, vol. 64(8), pages 3942-3970, August.
    13. René Caldentey & Gustavo Vulcano, 2007. "Online Auction and List Price Revenue Management," Management Science, INFORMS, vol. 53(5), pages 795-813, May.
    14. Manlu Chen & Ming Hu & Jianfu Wang, 2022. "Food Delivery Service and Restaurant: Friend or Foe?," Management Science, INFORMS, vol. 68(9), pages 6539-6551, September.
    15. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.
    16. Zhao, Chen & Wang, Zhongbin, 2023. "The impact of line-sitting on a two-server queueing system," European Journal of Operational Research, Elsevier, vol. 308(2), pages 782-800.
    17. Jara-Moroni, Pedro, 2012. "Rationalizability in games with a continuum of players," Games and Economic Behavior, Elsevier, vol. 75(2), pages 668-684.
    18. Hassin, Refael & Haviv, Moshe & Oz, Binyamin, 2023. "Strategic behavior in queues with arrival rate uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 217-224.
    19. Roger Guesnerie & Pedro Jara-Moroni, 2011. "Expectational coordination in simple economic contexts," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(2), pages 205-246, June.
    20. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:63:y:2015:i:1:p:247-259. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.