IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v41y1995i1p163-173.html
   My bibliography  Save this article

Decentralized Regulation of a Queue

Author

Listed:
  • Rafael Hassin

    (Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel)

Abstract

A bidding machanism for determining priorities in a service system is analyzed. It is shown that when all customers have the same exponential service demand, this mechanism induces both the socially optimal arrival process and the service order. It is also shown that the profit-maximizing service rate in this model is smaller than or equal to the socially optimal one.

Suggested Citation

  • Rafael Hassin, 1995. "Decentralized Regulation of a Queue," Management Science, INFORMS, vol. 41(1), pages 163-173, January.
    • Handle: RePEc:inm:ormnsc:v:41:y:1995:i:1:p:163-173
    DOI: 10.1287/mnsc.41.1.163
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.41.1.163
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.41.1.163?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
    ---><---

    Citations

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


    Cited by:

    1. Anouar El Haji & Sander Onderstal, 2019. "Trading places: An experimental comparison of reallocation mechanisms for priority queuing," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(4), pages 670-686, November.
    2. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    3. Moshe Haviv & Eyal Winter, 2020. "An optimal mechanism charging for priority in a queue," Papers 2002.06533, arXiv.org.
    4. Ani Dasgupta & Madhubani Ghosh, 2000. "Inducing Performance in a Queue via Prices: The Case of a Riverine Port," Management Science, INFORMS, vol. 46(11), pages 1466-1484, November.
    5. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    6. Moshe Haviv & Binyamin Oz, 2018. "Self-Regulation of an Unobservable Queue," Management Science, INFORMS, vol. 64(5), pages 2380-2389, May.
    7. 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.
    8. Huberman, Gur & Leshno, Jacob D. & Moallemi, Ciamac, 2017. "Monopoly without a monopolist: An economic analysis of the bitcoin payment system," Bank of Finland Research Discussion Papers 27/2017, Bank of Finland.
    9. 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.
    10. Luyi Yang & Laurens Debo & Varun Gupta, 2017. "Trading Time in a Congested Environment," Management Science, INFORMS, vol. 63(7), pages 2377-2395, July.
    11. Moshe Haviv & Binyamin Oz, 2014. "Self-regulation of a queue via random priorities," Discussion Paper Series dp674, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    12. Moshe Haviv & Binyamin Oz, 2015. "Regulating an observable M/M/1 queue," Discussion Paper Series dp691, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    13. 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.
    14. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
    15. Philipp Afèche & Opher Baron & Yoav Kerner, 2013. "Pricing Time-Sensitive Services Based on Realized Performance," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 492-506, July.
    16. Bradford, Richard M., 1996. "Pricing, routing, and incentive compatibility in multiserver queues," European Journal of Operational Research, Elsevier, vol. 89(2), pages 226-236, March.
    17. Hosain, Md Sajjad, 2018. "Bitcoin: Future transaction currency?," MPRA Paper 87588, University Library of Munich, Germany.
    18. Albert Y. Ha, 1998. "Incentive-Compatible Pricing for a Service Facility with Joint Production and Congestion Externalities," Management Science, INFORMS, vol. 44(12-Part-1), pages 1623-1636, December.
    19. 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.
    20. William P. Barnett & Daniel A. Levinthal, 2017. "Special Issue Introduction: Evolutionary Logics of Strategy and Organization," Strategy Science, INFORMS, vol. 2(1), pages 1-1, March.
    21. Albert Y. Ha, 2001. "Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements," Management Science, INFORMS, vol. 47(7), pages 915-930, July.
    22. 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.
    23. Moshe Haviv & Liron Ravner, 2016. "Strategic bidding in an accumulating priority queue: equilibrium analysis," Annals of Operations Research, Springer, vol. 244(2), pages 505-523, September.
    24. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, 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:inm:ormnsc:v:41:y:1995:i:1:p:163-173. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.