IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v50y2003i7p702-718.html
   My bibliography  Save this article

Decentralized admission control of a queueing system: A game‐theoretic model

Author

Listed:
  • Kyle Y. Lin

Abstract

Consider a distributed system where many gatekeepers share a single server. Customers arrive at each gatekeeper according to independent Poisson processes with different rates. Upon arrival of a new customer, the gatekeeper has to decide whether to admit the customer by sending it to the server, or to block it. Blocking costs nothing. The gatekeeper receives a reward after a customer completes the service, and incurs a cost if an admitted customer finds a busy server and therefore has to leave the system. Assuming an exponential service distribution, we formulate the problem as an n‐person non‐zero‐sum game in which each gatekeeper is interested in maximizing its own long‐run average reward. The key result is that each gatekeeper's optimal policy is that of a threshold type regardless what other gatekeepers do. We then derive Nash equilibria and discuss interesting insights. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 702–718, 2003.

Suggested Citation

  • Kyle Y. Lin, 2003. "Decentralized admission control of a queueing system: A game‐theoretic model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 702-718, October.
    • Handle: RePEc:wly:navres:v:50:y:2003:i:7:p:702-718
    DOI: 10.1002/nav.10085
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10085
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10085?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
    ---><---

    References listed on IDEAS

    as
    1. Steven A. Lippman & Shaler Stidham, 1977. "Individual versus Social Optimization in Exponential Congestion Systems," Operations Research, INFORMS, vol. 25(2), pages 233-247, April.
    2. MILLER, Bruce L., 1969. "A queueing reward system with several customer classes," LIDAM Reprints CORE 41, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Bruce L. Miller, 1969. "A Queueing Reward System with Several Customer Classes," Management Science, INFORMS, vol. 16(3), pages 234-245, November.
    4. Thomas B. Crabill & Donald Gross & Michael J. Magazine, 1977. "A Classified Bibliography of Research on Optimal Design and Control of Queues," Operations Research, INFORMS, vol. 25(2), pages 219-232, April.
    5. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    6. Robert C. Rue & Matthew Rosenshine, 1981. "Optimal control for entry of many classes of customers to an M/M/1 queue," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(3), pages 489-495, September.
    Full references (including those not matched with items on IDEAS)

    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. Kyle Y. Lin & Sheldon M. Ross, 2003. "Admission Control with Incomplete Information of a Queueing System," Operations Research, INFORMS, vol. 51(4), pages 645-654, August.
    2. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    3. Son, Jae-Dong, 2007. "Customer selection problem with profit from a sideline," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1084-1102, January.
    4. Jae‐Dong Son & Yaghoub Khojasteh Ghamari, 2008. "Optimal admission and pricing control problems in service industries with multiple servers and sideline profit," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 24(4), pages 325-342, July.
    5. Qiuping Yu & Gad Allon & Achal Bassamboo & Seyed Iravani, 2018. "Managing Customer Expectations and Priorities in Service Systems," Management Science, INFORMS, vol. 64(8), pages 3942-3970, August.
    6. E. Carrizosa & E. Conde & M. Muñoz-Márquez, 1998. "Admission Policies in Loss Queueing Models with Heterogeneous Arrivals," Management Science, INFORMS, vol. 44(3), pages 311-320, March.
    7. Davide Mezzogori & Giovanni Romagnoli & Francesco Zammori, 2021. "Defining accurate delivery dates in make to order job-shops managed by workload control," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 956-991, December.
    8. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.
    9. van Jaarsveld, W.L. & Dekker, R., 2009. "Finding optimal policies in the (S - 1, S ) lost sales inventory model with multiple demand classes," Econometric Institute Research Papers EI 2009-14, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    10. van Wijk, A.C.C. & Adan, I.J.B.F. & van Houtum, G.J., 2012. "Approximate evaluation of multi-location inventory models with lateral transshipments and hold back levels," European Journal of Operational Research, Elsevier, vol. 218(3), pages 624-635.
    11. 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.
    12. Li, Xueping & Wang, Jiao & Sawhney, Rapinder, 2012. "Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 99-109.
    13. Hessam Bavafa & Anne Canamucio & Steven C. Marcus & Christian Terwiesch & Rachel M. Werner, 2022. "Capacity Rationing in Primary Care: Provider Availability Shocks and Channel Diversion," Management Science, INFORMS, vol. 68(4), pages 2842-2859, April.
    14. Xufeng Yang & Wen Jiao & Juliang Zhang & Hong Yan, 2022. "Capacity management for a leasing system with different equipment and batch demands," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 3004-3020, July.
    15. Retsef Levi & Ana Radovanović, 2010. "Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources," Operations Research, INFORMS, vol. 58(2), pages 503-507, April.
    16. Tingliang Huang & Gad Allon & Achal Bassamboo, 2013. "Bounded Rationality in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 263-279, May.
    17. Apurva Jain & Kamran Moinzadeh & Aussadavut Dumrongsiri, 2015. "Priority Allocation in a Rental Model with Decreasing Demand," Manufacturing & Service Operations Management, INFORMS, vol. 17(2), pages 236-248, May.
    18. Huh, Woonghee Tim & Lee, Jaywon & Park, Heesang & Park, Kun Soo, 2019. "The potty parity problem: Towards gender equality at restrooms in business facilities," Socio-Economic Planning Sciences, Elsevier, vol. 68(C).
    19. Papier, Felix & Thonemann, Ulrich W., 2011. "Capacity rationing in rental systems with two customer classes and batch arrivals," Omega, Elsevier, vol. 39(1), pages 73-85, January.
    20. Gérard P. Cachon & Patrick T. Harker, 2002. "Competition and Outsourcing with Scale Economies," Management Science, INFORMS, vol. 48(10), pages 1314-1333, October.

    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:wly:navres:v:50:y:2003:i:7:p:702-718. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.