IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v283y2020i1p253-264.html
   My bibliography  Save this article

A discrete-time single-server Poisson queueing game: Equilibria simulated by an agent-based model

Author

Listed:
  • Sakuma, Yutaka
  • Masuyama, Hiroyuki
  • Fukuda, Emiko

Abstract

This paper considers a discrete-time single-server queue with a single acceptance period for a Poissonian population of homogeneous customers. Customers are served on a first-come first-served (FCFS) basis, and their service times are independent and identically distributed with a general distribution. We assume that each customer chooses her/his arrival-time slot with the goal of minimizing her/his expected waiting time in competition with other customers. For this queueing game, we derive a symmetric (mixed-strategy) Nash equilibrium; that is, an equilibrium arrival-time distribution of homogeneous customers, where their expected waiting times are identical. We also propose an agent-based model, which simulates the dynamics of customers who try to minimize their waiting times for service. Through numerical experiments, we confirm that this agent-based model achieves, in steady state, an arrival-time distribution similar to the equilibrium arrival-time distribution analytically obtained.

Suggested Citation

  • Sakuma, Yutaka & Masuyama, Hiroyuki & Fukuda, Emiko, 2020. "A discrete-time single-server Poisson queueing game: Equilibria simulated by an agent-based model," European Journal of Operational Research, Elsevier, vol. 283(1), pages 253-264.
    • Handle: RePEc:eee:ejores:v:283:y:2020:i:1:p:253-264
    DOI: 10.1016/j.ejor.2019.11.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719309051
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.11.003?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Darryl Seale & James Parco & William Stein & Amnon Rapoport, 2005. "Joining a Queue or Staying Out: Effects of Information Structure and Service Time on Arrival and Staying Out Decisions," Experimental Economics, Springer;Economic Science Association, vol. 8(2), pages 117-144, June.
    3. Roger B. Myerson, 1998. "Population uncertainty and Poisson games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 375-392.
    4. Vickrey, William S, 1969. "Congestion Theory and Transport Investment," American Economic Review, American Economic Association, vol. 59(2), pages 251-260, May.
    5. Jesper Breinbjerg & Alexander Sebald & Lars Peter Østerdal, 2016. "Strategic behavior and social outcomes in a bottleneck queue: experimental evidence," Review of Economic Design, Springer;Society for Economic Design, vol. 20(3), pages 207-236, September.
    6. Ravner, Liron, 2014. "Equilibrium arrival times to a queue with order penalties," European Journal of Operational Research, Elsevier, vol. 239(2), pages 456-468.
    7. Huiming Zhang & Bo Li, 2016. "Characterizations of discrete compound Poisson distributions," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 45(22), pages 6789-6802, November.
    8. Rapoport, Amnon & Stein, William E. & Parco, James E. & Seale, Darryl A., 2004. "Equilibrium play in single-server queues with endogenously determined arrival times," Journal of Economic Behavior & Organization, Elsevier, vol. 55(1), pages 67-91, September.
    9. Refael Hassin & Yana Kleiner, 2011. "Equilibrium and optimal arrival patterns to a server with opening and closing times," IISE Transactions, Taylor & Francis Journals, vol. 43(3), pages 164-175.
    10. Breinbjerg, Jesper, 2017. "Equilibrium arrival times to queues with general service times and non-linear utility functions," European Journal of Operational Research, Elsevier, vol. 261(2), pages 595-605.
    11. Hassin, Refael, 1985. "On the Optimality of First Come Last Served Queues," Econometrica, Econometric Society, vol. 53(1), pages 201-202, January.
    12. Otsubo, Hironori & Rapoport, Amnon, 2008. "Vickrey's model of traffic congestion discretized," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 873-889, December.
    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. Tzvi Alon & Moshe Haviv, 2023. "Choosing a batch to be processed," Annals of Operations Research, Springer, vol. 326(1), pages 67-87, July.
    2. Alon, Tzvi & Haviv, Moshe, 2022. "Discrete-time strategic job arrivals to a single machine with waiting and lateness penalties," European Journal of Operational Research, Elsevier, vol. 303(1), pages 480-486.

    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. 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.
    2. Jesper Breinbjerg & Trine Tornøe Platz & Lars Peter Østerdal, 2024. "Equilibrium arrivals to a last-come first-served preemptive-resume queue," Annals of Operations Research, Springer, vol. 336(3), pages 1551-1572, May.
    3. Breinbjerg, Jesper, 2017. "Equilibrium arrival times to queues with general service times and non-linear utility functions," European Journal of Operational Research, Elsevier, vol. 261(2), pages 595-605.
    4. Breinbjerg, Jesper & Østerdal, Lars Peter, 2017. "Equilibrium Arrival Times to Queues: The Case of Last-Come First-Serve Preemptive-Resume," Discussion Papers on Economics 3/2017, University of Southern Denmark, Department of Economics.
    5. Alon, Tzvi & Haviv, Moshe, 2022. "Discrete-time strategic job arrivals to a single machine with waiting and lateness penalties," European Journal of Operational Research, Elsevier, vol. 303(1), pages 480-486.
    6. 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.
    7. Jesper Breinbjerg & Alexander Sebald & Lars Peter Østerdal, 2016. "Strategic behavior and social outcomes in a bottleneck queue: experimental evidence," Review of Economic Design, Springer;Society for Economic Design, vol. 20(3), pages 207-236, September.
    8. Breinbjerg, Jesper, 2016. "Strategic Arrival Times to Queueing Systems," Discussion Papers on Economics 6/2016, University of Southern Denmark, Department of Economics.
    9. 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.
    10. Moshe Haviv & Liron Ravner, 2014. "Strategic timing of arrivals to a finite queue multi-server loss system," Discussion Paper Series dp675, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    11. Ravner, Liron, 2014. "Equilibrium arrival times to a queue with order penalties," European Journal of Operational Research, Elsevier, vol. 239(2), pages 456-468.
    12. Otsubo, Hironori & Rapoport, Amnon, 2008. "Vickrey's model of traffic congestion discretized," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 873-889, December.
    13. Ravner, Liron & Haviv, Moshe & Vu, Hai L., 2016. "A strategic timing of arrivals to a linear slowdown processor sharing system," European Journal of Operational Research, Elsevier, vol. 255(2), pages 496-504.
    14. Tzvi Alon & Moshe Haviv, 2023. "Choosing a batch to be processed," Annals of Operations Research, Springer, vol. 326(1), pages 67-87, July.
    15. Stein, William E. & Rapoport, Amnon & Seale, Darryl A. & Zhang, Hongtao & Zwick, Rami, 2007. "Batch queues with choice of arrivals: Equilibrium analysis and experimental study," Games and Economic Behavior, Elsevier, vol. 59(2), pages 345-363, May.
    16. de Palma, André & Fosgerau, Mogens, 2013. "Random queues and risk averse users," European Journal of Operational Research, Elsevier, vol. 230(2), pages 313-320.
    17. Ghosh, Souvik & Hassin, Refael, 2021. "Inefficiency in stochastic queueing systems with strategic customers," European Journal of Operational Research, Elsevier, vol. 295(1), pages 1-11.
    18. Rapoport, Amnon & Stein, William E. & Mak, Vincent & Zwick, Rami & Seale, Darryl A., 2010. "Endogenous arrivals in batch queues with constant or variable capacity," Transportation Research Part B: Methodological, Elsevier, vol. 44(10), pages 1166-1185, December.
    19. Eitan Altman & Nahum Shimkin, 2016. "The Ordered Timeline Game: Strategic Posting Times Over a Temporally Ordered Shared Medium," Dynamic Games and Applications, Springer, vol. 6(4), pages 429-455, December.
    20. 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.

    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:eee:ejores:v:283:y:2020:i:1:p:253-264. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.