Skip to main content
Log in

On balking from an empty queue

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The intuition while observing the economy of queueing systems, is that one’s motivation to join the system, decreases with its level of congestion. Here we present a queueing model where sometimes the opposite is the case. The point of departure is the standard first-come first-served single server queue with Poisson arrivals. Customers commence service immediately if upon their arrival the server is idle. Otherwise, they are informed if the queue is empty or not. Then, they have to decide whether to join or not. We assume that the customers are homogeneous and when they consider whether to join or not, they assess their queueing costs against their reward due to service completion. As the whereabouts of customers interact, we look for the (possibly mixed) join/do not join Nash equilibrium strategy, a strategy that if adopted by all, then under the resulting steady-state conditions, no one has any incentive not to follow it oneself. We show that when the queue is empty then depending on the service distribution, both ‘avoid the crowd’ (ATC) and ‘follow the crowd’ (FTC) scenarios (as well as none-of-the-above) are possible. When the queue is not empty, the situation is always that of ATC. Also, we show that under Nash equilibrium it is possible (depending on the service distribution) that the joining probability when the queue is empty is smaller than it is when the queue is not empty.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Altman, E., Hassin, R.: Non-threshold equilibrium for customers joining an M/G/1 Queue. In: Proceedings of the 10th International Symposium of Dynamic Games (2002)

  2. Barlow, R.E., Proschan, F.: Mathematical Theory of Reliability. Wiley, New York (1965)

    Google Scholar 

  3. Edelson, N.M., Hildebrand, K.: Congestion tolls for the Poisson queueing processes. Econometrica 43, 81–92 (1973)

    Article  Google Scholar 

  4. Fakinos, D.: The expected remaining service time in the single server queue. Oper. Res. 30, 1014–1018 (1982)

    Article  Google Scholar 

  5. Hassin, R., Haviv, M.: Nash equilibrium and subgame perfection: The case of observable queues. Ann. Oper. Res. 113, 15–26 (2002)

    Article  Google Scholar 

  6. Hassin, R., Haviv, M.: To Queue or not to Queue: Equilibrium Behavior in Queueing System. Kluwer’s International Series, Boston (2003)

    Google Scholar 

  7. Mandelbaum, A., Yechiali, U.: The conditional residual service time in M/G/1 queue, unpublished manuscript (1979). Also at http://www.math.tau.ac.il/uriy/Publications.html

  8. Maynard-Smith, J.: Evolution and Game Theory. Cambridge University Press, Cambridge (1982)

    Google Scholar 

  9. Naor, P.: The regulation of queue size by levying tolls. Econometrica 37, 15–24 (1969)

    Article  Google Scholar 

  10. Whitt, W.: Deciding which queue to join: some counterexamples. Oper. Res. 34, 55–62 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yoav Kerner.

Additional information

This research was supported by The Israel Science Foundation Grant No. 237/02.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haviv, M., Kerner, Y. On balking from an empty queue. Queueing Syst 55, 239–249 (2007). https://doi.org/10.1007/s11134-007-9020-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-007-9020-2

Keywords

Mathematics Subject Classification (2000)

Navigation