Skip to main content
Log in

Proofs of conjectures on the competition between observable and unobservable servers

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The impact of information about the quality of service on marketing can be demonstrated by a competition between an observable queue and an unobservable queue. An illustration was given by an earlier paper of Hassin (Manag Sci 42:618–623, 1996), which considers two gas stations located one after the other on a main road. A driver who needs to fill the gas can see the queue length upon arriving at the first station, but not the second one. The driver decides which station to enter based only on this partial information for minimizing the expected waiting time. Via extensive numerical experiments, Hassin showed that the first server enjoys a larger market share, which led him to making a number of challenging conjectures. In this paper, we prove that all the numerical observations and conjectures are true so that the advantage of being the first server is assured.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Altman, E., Jiménez, T., Núñez-Queija, R., Yechiali, U.: Optimal routing among \(\cdot /M/1\) queues with partial information. Stoch. Model. 20, 149–171 (2004)

    Article  Google Scholar 

  2. Dvir, N., Hassin, R., Haviv, M.: On equilibrium threshold strategies when choosing between observable and unobservable queues. Oper. Res. Lett. 50, 555–560 (2022)

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Hassin, R.: On the advantage of being the first server. Manag. Sci. 42, 618–623 (1996)

    Article  Google Scholar 

  5. Hassin, R.: Rational Queueing. CRC Press, Boca Raton (2016)

    Google Scholar 

  6. Hassin, R., Haviv, M.: To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems. Kluwer, Boston (2003)

    Book  Google Scholar 

  7. Haviv, M., Zlotnikov, R.: Computational schemes for two exponential servers where the first has a finite buffer. RAIRO Oper. Res. 45, 17–36 (2011)

    Article  Google Scholar 

  8. Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM, Philadelphia (1999)

    Book  Google Scholar 

  9. Minc, H.: Nonnegative Matrices. Wiley, New York (1988)

    Google Scholar 

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

    Article  Google Scholar 

  11. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore (1981)

    Google Scholar 

Download references

Acknowledgements

We are grateful to the Associate Editor and the reviewer for their valuable comments and suggestions, which greatly improved this paper. This work was supported under the framework of international cooperation program managed by the National Research Foundation of Korea (2019K2A9A1A06102882, FY2019) and the Minister of Science and Technology of Taiwan (MOST-109-2923-H-259-001-MY2).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jeongsim Kim.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, B., Kim, J., Su, Y. et al. Proofs of conjectures on the competition between observable and unobservable servers. Queueing Syst 104, 211–238 (2023). https://doi.org/10.1007/s11134-023-09887-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-023-09887-7

Keywords

Mathematics Subject Classification

Navigation