IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v42y2017i3p626-647.html
   My bibliography  Save this article

An ɛ -Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic

Author

Listed:
  • Rami Atar

    (Department of Electrical Engineering, Technion–Israel Institute of Technology, Haifa 32000, Israel)

  • Subhamay Saha

    (Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati 781039, Assam, India)

Abstract

A multiclass queue with many servers is considered, where customers make a join-or-leave decision upon arrival based on queue length information, without knowing the state of other queues. A game theoretic formulation is proposed and analyzed, that takes advantage of a phenomenon unique to heavy traffic regimes, namely, Reiman’s snaphshot principle, by which waiting times are predicted with high precision by the information available upon arrival. The payoff considered is given as a random variable , which depends on the customer’s decision, accounting for waiting time in the queue and penalty for leaving. The notion of an equilibrium is only meaningful in an asymptotic framework, which is taken here to be the Halfin-Whitt heavy traffic regime. The main result is the identification of an ɛ -Nash equilibrium with probability approaching 1. On the way to proving this result, new diffusion limit results for systems with finite buffers are obtained.

Suggested Citation

  • Rami Atar & Subhamay Saha, 2017. "An ɛ -Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 626-647, August.
    • Handle: RePEc:inm:ormoor:v:42:y:2017:i:3:p:626-647
    DOI: 10.1287/moor.2016.0820
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2016.0820
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2016.0820?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. Itay Gurvich & Ward Whitt, 2009. "Queue-and-Idleness-Ratio Controls in Many-Server Service Systems," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 363-396, May.
    2. Gad Allon & Itai Gurvich, 2010. "Pricing and Dimensioning Competing Large-Scale Service Providers," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 449-469, August.
    3. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    4. 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.
    5. Pengfei Guo & Refael Hassin, 2011. "Strategic Behavior and Social Optimization in Markovian Vacation Queues," Operations Research, INFORMS, vol. 59(4), pages 986-997, August.
    6. Ragavendran Gopalakrishnan & Sherwin Doroudi & Amy R. Ward & Adam Wierman, 2016. "Routing and Staffing When Servers Are Strategic," Operations Research, INFORMS, vol. 64(4), pages 1033-1050, August.
    7. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    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. Opher Baron & Antonis Economou & Athanasia Manou, 2022. "Increasing social welfare with delays: Strategic customers in the M/G/1 orbit queue," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2907-2924, July.
    2. Bountali, Olga & Economou, Antonis, 2017. "Equilibrium joining strategies in batch service queueing systems," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1142-1151.
    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. Gad Allon & Achal Bassamboo & Eren B. Çil, 2012. "Large-Scale Service Marketplaces: The Role of the Moderating Firm," Management Science, INFORMS, vol. 58(10), pages 1854-1872, October.
    5. Sheng Zhu & Jinting Wang & Bin Liu, 2020. "Equilibrium joining strategies in the Mn/G/1 queue with server breakdowns and repairs," Operational Research, Springer, vol. 20(4), pages 2163-2187, December.
    6. Rouba Ibrahim & Mor Armony & Achal Bassamboo, 2017. "Does the Past Predict the Future? The Case of Delay Announcements in Service Systems," Management Science, INFORMS, vol. 63(6), pages 1762-1780, June.
    7. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    8. Dimitrakopoulos, Y. & Burnetas, A.N., 2016. "Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control," European Journal of Operational Research, Elsevier, vol. 252(2), pages 477-486.
    9. Pengfei Guo & Zhe George Zhang, 2013. "Strategic Queueing Behavior and Its Impact on System Performance in Service Systems with the Congestion-Based Staffing Policy," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 118-131, September.
    10. 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.
    11. Ziani, Sofiane & Rahmoune, Fazia & Radjef, Mohammed Said, 2015. "Customers’ strategic behavior in batch arrivals M2/M/1 queue," European Journal of Operational Research, Elsevier, vol. 247(3), pages 895-903.
    12. Costis Maglaras & John Yao & Assaf Zeevi, 2018. "Optimal Price and Delay Differentiation in Large-Scale Queueing Systems," Management Science, INFORMS, vol. 64(5), pages 2427-2444, May.
    13. Lingjiao Zhang & Jinting Wang & Yilin Wang, 2023. "Strategic Behavior and Optimization of an M/M/1 Queue with N-Policy and Hysteretic Control," Methodology and Computing in Applied Probability, Springer, vol. 25(4), pages 1-29, December.
    14. Benjamin Legros, 2021. "Agents’ Self‐Routing for Blended Operations to Balance Inbound and Outbound Services," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3599-3614, October.
    15. 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.
    16. Gopinath Panda & Veena Goswami & Abhijit Datta Banik, 2016. "Equilibrium and Socially Optimal Balking Strategies in Markovian Queues with Vacations and Sequential Abandonment," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-34, October.
    17. 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.
    18. 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.
    19. 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.
    20. Hanukov, Gabi & Avinadav, Tal & Chernonog, Tatyana & Yechiali, Uri, 2020. "A service system with perishable products where customers are either fastidious or strategic," International Journal of Production Economics, Elsevier, vol. 228(C).

    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:ormoor:v:42:y:2017:i:3:p:626-647. 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: 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.