IDEAS home Printed from https://ideas.repec.org/p/ecl/stabus/1782r.html
   My bibliography  Save this paper

Self-Interested Routing in Queueing Networks

Author

Listed:
  • Parlakturk, Ali

    (Stanford U)

  • Kumar, Sunil

Abstract

We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two station multiclass queueing network in which the system manager chooses the scheduling rule used, and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a non-trivial scheduling rule that negates the performance degradation due to self-interested routing and achieves a Nash equilibrium with performance comparable to the first-best solution.

Suggested Citation

  • Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    • Handle: RePEc:ecl:stabus:1782r
    as

    Download full text from publisher

    File URL: http://gsbapps.stanford.edu/researchpapers/library/RP1782R.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. I. Adiri & U. Yechiali, 1974. "Optimal Priority-Purchasing and Pricing Decisions in Nonmonopoly and Monopoly Queues," Operations Research, INFORMS, vol. 22(5), pages 1051-1066, October.
    2. Colin E. Bell & Shaler Stidham, Jr., 1983. "Individual versus Social Optimization in the Allocation of Customers to Alternative Servers," Management Science, INFORMS, vol. 29(7), pages 831-839, July.
    3. Eitan Altman & Nahum Shimkin, 1998. "Individual Equilibrium and Learning in Processor Sharing Systems," Operations Research, INFORMS, vol. 46(6), pages 776-784, December.
    4. Ali Sharifnia, 1997. "Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization," Operations Research, INFORMS, vol. 45(2), pages 309-314, April.
    5. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    6. Constantinos Maglaras & Assaf Zeevi, 2003. "Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations," Management Science, INFORMS, vol. 49(8), pages 1018-1038, August.
    7. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    8. Ward Whitt, 1986. "Deciding Which Queue to Join: Some Counterexamples," Operations Research, INFORMS, vol. 34(1), pages 55-62, February.
    9. Pradeep Dubey, 1986. "Inefficiency of Nash Equilibria," Mathematics of Operations Research, INFORMS, vol. 11(1), pages 1-8, February.
    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. Vasiliki Kostami & Amy R. Ward, 2009. "Managing Service Systems with an Offline Waiting Option and Customer Abandonment," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 644-656, November.
    2. Lauren Xiaoyuan Lu & Jan A. Van Mieghem & R. Canan Savaskan, 2006. "Incentives for Quality through Endogenous Routing," Discussion Papers 1436, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Shiliang Cui & Xuanming Su & Senthil Veeraraghavan, 2019. "A Model of Rational Retrials in Queues," Operations Research, INFORMS, vol. 67(6), pages 1699-1718, November.
    4. Lauren Xiaoyuan Lu & Jan A. Van Mieghem & R. Canan Savaskan, 2009. "Incentives for Quality Through Endogenous Routing," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 254-273, 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. Barış Ata & Anton Skaro & Sridhar Tayur, 2017. "OrganJet: Overcoming Geographical Disparities in Access to Deceased Donor Kidneys in the United States," Management Science, INFORMS, vol. 63(9), pages 2776-2794, September.
    7. René Caldentey & Lawrence M. Wein, 2006. "Revenue Management of a Make-to-Stock Queue," Operations Research, INFORMS, vol. 54(5), pages 859-875, October.
    8. Michal Feldman & Tami Tamir, 2012. "Conflicting Congestion Effects in Resource Allocation Games," Operations Research, INFORMS, vol. 60(3), pages 529-540, June.
    9. Brooks, James D. & Kar, Koushik & Mendonça, David J., 2016. "Allocation of flows in closed bipartite queueing networks," European Journal of Operational Research, Elsevier, vol. 255(2), pages 333-344.
    10. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.

    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. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    2. Xuanming Su & Stefanos Zenios, 2004. "Patient Choice in Kidney Allocation: The Role of the Queueing Discipline," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 280-301, June.
    3. Olga Bountali & Antonis Economou, 2019. "Strategic customer behavior in a two-stage batch processing system," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 3-29, October.
    4. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.
    5. 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.
    6. Sarang Deo & Itai Gurvich, 2011. "Centralized vs. Decentralized Ambulance Diversion: A Network Perspective," Management Science, INFORMS, vol. 57(7), pages 1300-1319, July.
    7. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.
    8. Mark Fackrell & Peter Taylor & Jiesen Wang, 2021. "Strategic customer behavior in an M/M/1 feedback queue," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 223-259, April.
    9. Athanasia Manou & Antonis Economou & Fikri Karaesmen, 2014. "Strategic Customers in a Transportation Station: When Is It Optimal to Wait?," Operations Research, INFORMS, vol. 62(4), pages 910-925, August.
    10. Baric{s} Ata & Shiri Shneorson, 2006. "Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates," Management Science, INFORMS, vol. 52(11), pages 1778-1791, November.
    11. Omar Besbes & Costis Maglaras, 2009. "Revenue Optimization for a Make-to-Order Queue in an Uncertain Market Environment," Operations Research, INFORMS, vol. 57(6), pages 1438-1450, December.
    12. Cripps, Martin W. & Thomas, Caroline D., 2019. "Strategic experimentation in queues," Theoretical Economics, Econometric Society, vol. 14(2), May.
    13. Wang, Jinting & Zhang, Feng, 2013. "Strategic joining in M/M/1 retrial queues," European Journal of Operational Research, Elsevier, vol. 230(1), pages 76-87.
    14. Rouba Ibrahim, 2018. "Sharing delay information in service systems: a literature survey," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 49-79, June.
    15. Olga Bountali & Antonis Economou, 2019. "Equilibrium threshold joining strategies in partially observable batch service queueing systems," Annals of Operations Research, Springer, vol. 277(2), pages 231-253, June.
    16. Roei Engel & Refael Hassin, 2017. "Customer equilibrium in a single-server system with virtual and system queues," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 161-180, October.
    17. Zhongbin Wang & Luyi Yang & Shiliang Cui & Jinting Wang, 2021. "In-queue priority purchase: a dynamic game approach," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 343-381, April.
    18. Albert Y. Ha, 2001. "Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements," Management Science, INFORMS, vol. 47(7), pages 915-930, July.
    19. Gérard P. Cachon & Patrick T. Harker, 2002. "Competition and Outsourcing with Scale Economies," Management Science, INFORMS, vol. 48(10), pages 1314-1333, October.
    20. Rob Shone & Vincent A. Knight & Paul R. Harper, 2020. "A conservative index heuristic for routing problems with multiple heterogeneous service facilities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 511-543, December.

    More about this item

    Statistics

    Access and download statistics

    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:ecl:stabus:1782r. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/gsstaus.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.