IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v97y2021i3d10.1007_s11134-021-09694-y.html
   My bibliography  Save this article

In-queue priority purchase: a dynamic game approach

Author

Listed:
  • Zhongbin Wang

    (Nankai University)

  • Luyi Yang

    (The University of California, Berkeley)

  • Shiliang Cui

    (Georgetown University)

  • Jinting Wang

    (Central University of Finance and Economics)

Abstract

Pay-for-priority is a common practice in congestion-prone service systems. The extant literature on this topic restricts attention to the case where the only epoch for customers to purchase priority is upon arrival, and if customers choose not to upgrade when they arrive, they cannot do so later during their wait. A natural alternative is to let customers pay and upgrade to priority at any time during their stay in the queue, even if they choose not to do so initially. This paper builds a queueing-game-theoretic model that explicitly captures self-interested customers’ dynamic in-queue priority-purchasing behavior. When all customers (who have not upgraded yet) simultaneously decide whether to upgrade, we find in our model that pure-strategy equilibria do not exist under some intuitive criteria, contrasting the findings in classical models where customers can only purchase priority upon arrival. However, when customers sequentially decide whether to upgrade, threshold-type pure-strategy equilibria may exist. In particular, under sufficiently light traffic, if the number of ordinary customers accumulates to a certain threshold, then it is always the second last customer who upgrades, but in general, it could be a customer from another position, and the queue-length threshold that triggers an upgrade can also vary with the traffic intensity. Finally, we find that in-queue priority purchase subject to the sequential rule yields less revenue than upon-arrival priority purchase in systems with small buffers.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:queues:v:97:y:2021:i:3:d:10.1007_s11134-021-09694-y
    DOI: 10.1007/s11134-021-09694-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-021-09694-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11134-021-09694-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yoav Kerner & Eliran Sherzer & Mor Ann Yanco, 2017. "On non-equilibria threshold strategies in ticket queues," Queueing Systems: Theory and Applications, Springer, vol. 86(3), pages 419-431, August.
    2. Haim Mendelson & Seungjin Whang, 1990. "Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue," Operations Research, INFORMS, vol. 38(5), pages 870-883, October.
    3. 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.
    4. Luyi Yang & Laurens Debo & Varun Gupta, 2017. "Trading Time in a Congested Environment," Management Science, INFORMS, vol. 63(7), pages 2377-2395, July.
    5. Refael Hassin & Moshe Haviv, 1997. "Equilibrium Threshold Strategies: The Case of Queues with Priorities," Operations Research, INFORMS, vol. 45(6), pages 966-973, December.
    6. K. R. Balachandran, 1972. "Purchasing Priorities in Queues," Management Science, INFORMS, vol. 18(5-Part-1), pages 319-326, January.
    7. Jinting Wang & Shiliang Cui & Zhongbin Wang, 2019. "Equilibrium Strategies in M/M/1 Priority Queues with Balking," Production and Operations Management, Production and Operations Management Society, vol. 28(1), pages 43-62, January.
    8. David Assaf & Moshe Haviv, 1990. "Reneging from Processor Sharing Systems and Random Queues," Mathematics of Operations Research, INFORMS, vol. 15(1), pages 129-138, February.
    9. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    10. Zeynep Akşin & Barış Ata & Seyed Morteza Emadi & Che-Lin Su, 2013. "Structural Estimation of Callers' Delay Sensitivity in Call Centers," Management Science, INFORMS, vol. 59(12), pages 2727-2746, December.
    11. Srinagesh Gavirneni & Vidyadhar G. Kulkarni, 2016. "Self-Selecting Priority Queues with Burr Distributed Waiting Costs," Production and Operations Management, Production and Operations Management Society, vol. 25(6), pages 979-992, June.
    12. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    13. Hamid Nazerzadeh & Ramandeep S. Randhawa, 2018. "Near†Optimality of Coarse Service Grades for Customer Differentiation in Queueing Systems," Production and Operations Management, Production and Operations Management Society, vol. 27(3), pages 578-595, March.
    14. Baris Ata & Xiaoshan Peng, 2018. "An Equilibrium Analysis of a Multiclass Queue with Endogenous Abandonments in Heavy Traffic," Operations Research, INFORMS, vol. 66(1), pages 163-183, January.
    15. Itai Gurvich & Martin A. Lariviere & Can Ozkan, 2019. "Coverage, Coarseness, and Classification: Determinants of Social Efficiency in Priority Queues," Management Science, INFORMS, vol. 65(3), pages 1061-1075, March.
    16. Hanna Alperstein, 1988. "Note---Optimal Pricing Policy for the Service Facility Offering a Set of Priority Prices," Management Science, INFORMS, vol. 34(5), pages 666-671, May.
    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. 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.
    2. 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.
    3. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    4. Luyi Yang & Shiliang Cui & Zhongbin Wang, 2022. "Design of Covid‐19 testing queues," Production and Operations Management, Production and Operations Management Society, vol. 31(5), pages 2204-2221, May.
    5. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    6. Zhongbin Wang & Yunan Liu & Lei Fang, 2022. "Pay to activate service in vacation queues," Production and Operations Management, Production and Operations Management Society, vol. 31(6), pages 2609-2627, June.
    7. Liu, Jian & Chen, Jian & Bo, Rui & Meng, Fanlin & Xu, Yong & Li, Peng, 2023. "Increases or discounts: Price strategies based on customers’ patience times," European Journal of Operational Research, Elsevier, vol. 305(2), pages 722-737.
    8. 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.
    9. Jiaqi Zhou & Ilya O. Ryzhov, 2021. "Equilibrium analysis of observable express service with customer choice," Queueing Systems: Theory and Applications, Springer, vol. 99(3), pages 243-281, December.
    10. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.
    11. 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.
    12. Choi, Jay & Kim, Byung-Cheol, 2008. "Net Neutrality and Investment Incentives," Working Paper Series 19111, Victoria University of Wellington, The New Zealand Institute for the Study of Competition and Regulation.
    13. Jay Pil Choi & Byung‐Cheol Kim, 2010. "Net neutrality and investment incentives," RAND Journal of Economics, RAND Corporation, vol. 41(3), pages 446-471, September.
    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. Laurens Debo & Senthil Veeraraghavan, 2014. "Equilibrium in Queues Under Unknown Service Times and Service Value," Operations Research, INFORMS, vol. 62(1), pages 38-57, February.
    18. Baris Ata & Peter W. Glynn & Xiaoshan Peng, 2017. "An equilibrium analysis of a discrete-time Markovian queue with endogenous abandonments," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 141-212, June.
    19. Moshe, Shir & Oz, Binyamin, 2023. "Charging more for priority via two-part tariff for accumulating priorities," European Journal of Operational Research, Elsevier, vol. 304(2), pages 652-660.
    20. Itai Gurvich & Martin A. Lariviere & Can Ozkan, 2019. "Coverage, Coarseness, and Classification: Determinants of Social Efficiency in Priority Queues," Management Science, INFORMS, vol. 65(3), pages 1061-1075, March.

    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:spr:queues:v:97:y:2021:i:3:d:10.1007_s11134-021-09694-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.