IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v26y2024i2p775-795.html

Paid Priority in Service Systems: Theory and Experiments

Author

Listed:
  • Andrew E. Frazelle

    (Jindal School of Management, The University of Texas at Dallas, Richardson, Texas 75080)

  • Elena Katok

    (Jindal School of Management, The University of Texas at Dallas, Richardson, Texas 75080)

Abstract

Problem definition : Motivated by the prevalence of paid priority programs in practice, we study a service provider operating a system in which customers have random waiting costs and choose between two queues: regular (no cost) or priority (for a fee). We also consider a mechanism by which the provider redistributes a portion of priority revenue to compensate regular-queue customers for their longer waits. Methodology/results : To determine the waiting-cost-dependent equilibrium priority purchasing strategies, we establish structural results at a sample-path level and prove that they generalize. In models both with and without compensation, the equilibrium exhibits a cost-dependent, increasing-threshold structure. We also prove that compensation entails fewer priority purchases because compensating regular-queue customers makes priority less attractive. We then analyze system-wide performance. Despite the fewer priority purchases, for a fixed (low) priority fee, compensation can actually reduce equilibrium aggregate waiting cost by filtering low-waiting-cost customers out of the priority queue; however, this finding does not hold when comparing at the optimal fees. We then test our models in the laboratory. Key behavioral regularities are that low-cost subjects are overrepresented (underrepresented) in the priority (regular) queue compared with equilibrium, and subjects with low and high waiting costs tend to overbuy priority at high fees. Managerial implications : Our theoretical and behavioral results guide service providers in managing priority service systems. First, we find that compensation does not provide short-term performance benefits. Second, our experiments reveal that suboptimal customer decisions partially prevent efficient reordering of customers by waiting cost, leading to higher aggregate waiting cost than the equilibrium predicts, but still lower than under first-come, first-serve service. Finally, because customers tolerate higher fees than they should, a revenue-maximizing provider can set a higher priority fee and extract more revenue than it could if customers acted rationally.

Suggested Citation

  • Andrew E. Frazelle & Elena Katok, 2024. "Paid Priority in Service Systems: Theory and Experiments," Manufacturing & Service Operations Management, INFORMS, vol. 26(2), pages 775-795, March.
  • Handle: RePEc:inm:ormsom:v:26:y:2024:i:2:p:775-795
    DOI: 10.1287/msom.2021.0387
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.0387
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.0387?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. Ryan W. Buell, 2021. "Last-Place Aversion in Queues," Management Science, INFORMS, vol. 67(3), pages 1430-1452, March.
    2. Mirko Kremer & Laurens Debo, 2016. "Inferring Quality from Wait Time," Management Science, INFORMS, vol. 62(10), pages 3023-3038, October.
    3. Maxime C. Cohen & Michael D. Fiszer & Baek Jung Kim, 2022. "Frustration-Based Promotions: Field Experiments in Ride-Sharing," Management Science, INFORMS, vol. 68(4), pages 2432-2464, April.
    4. Leonard Kleinrock, 1967. "Optimum Bribing for Queue Position," Operations Research, INFORMS, vol. 15(2), pages 304-318, April.
    5. 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.
    6. 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.
    7. Richard C. Larson, 1987. "OR Forum—Perspectives on Queues: Social Justice and the Psychology of Queueing," Operations Research, INFORMS, vol. 35(6), pages 895-905, December.
    8. Dold, Malte & Khadjavi, Menusch, 2017. "Jumping the queue: An experiment on procedural preferences," Games and Economic Behavior, Elsevier, vol. 102(C), pages 127-137.
    9. Gad Allon & Eran Hanany, 2012. "Cutting in Line: Social Norms in Queues," Management Science, INFORMS, vol. 58(3), pages 493-506, March.
    10. Daniel M. Rosenblum, 1992. "Allocation of Waiting Time by Trading in Position on a G/M/S Queue," Operations Research, INFORMS, vol. 40(3-supplem), pages 338-342, June.
    11. Refael Hassin & Moshe Haviv, 1997. "Equilibrium Threshold Strategies: The Case of Queues with Priorities," Operations Research, INFORMS, vol. 45(6), pages 966-973, December.
    12. 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.
    13. Moshe Haviv & Eyal Winter, 2020. "An optimal mechanism charging for priority in a queue," Papers 2002.06533, arXiv.org.
    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. Zhouzi Li & Mor Harchol-Balter & Alan Scheller-Wolf, 2026. "When does partial priority improve revenue?," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-35, March.
    2. Abdullah Althenayyan & Sezer Ülkü & Luyi Yang & Shiliang Cui, 2025. "Not All Lines Are Skipped Equally: An Experimental Investigation of Line-Sitting and Express Lines," Manufacturing & Service Operations Management, INFORMS, vol. 27(1), pages 287-304, January.

    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. Abdullah Althenayyan & Sezer Ülkü & Luyi Yang & Shiliang Cui, 2025. "Not All Lines Are Skipped Equally: An Experimental Investigation of Line-Sitting and Express Lines," Manufacturing & Service Operations Management, INFORMS, vol. 27(1), pages 287-304, January.
    2. 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.
    3. 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.
    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. Ricky Roet-Green & Aditya Shetty, 2022. "On Designing a Socially Optimal Expedited Service and Its Impact on Individual Welfare," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1843-1858, May.
    6. Pollitt, Michael G. & Duma, Daniel & Mitchell, Rona & Covatariu, Andrei, 2026. "Managing Great Britain's electricity distribution connection queue: lessons from auction theory and a potential position trading system," Utilities Policy, Elsevier, vol. 98(C).
    7. Yaolei Wang & Ping Cao & Jingui Xie & Dongyuan Zhan, 2025. "Advance Selling and Upgrading in Priority Queues," Manufacturing & Service Operations Management, INFORMS, vol. 27(5), pages 1664-1682, September.
    8. 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.
    9. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    10. Arturo Estrada Rodriguez & Rouba Ibrahim & Dongyuan Zhan, 2025. "On Customer (Dis-)Honesty in Unobservable Queues: The Role of Lying Aversion," Management Science, INFORMS, vol. 71(1), pages 844-860, January.
    11. Zhongbin Wang & Shiliang Cui & Lei Fang, 2023. "Distance-Based Service Priority: An Innovative Mechanism to Increase System Throughput and Social Welfare," Manufacturing & Service Operations Management, INFORMS, vol. 25(1), pages 353-369, January.
    12. Andrew M. Davis & Shawn Mankad & Charles J. Corbett & Elena Katok, 2024. "OM Forum—The Best of Both Worlds: Machine Learning and Behavioral Science in Operations Management," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1605-1621, September.
    13. Mihalis G. Markakis & Kalyan Talluri & Dmitrii Tikhonenko, 2023. "Sequential Bidding for Merging in Algorithmic Traffic," Manufacturing & Service Operations Management, INFORMS, vol. 25(1), pages 168-181, January.
    14. Sezer Ülkü & Chris Hydock & Shiliang Cui, 2022. "Social Queues (Cues): Impact of Others’ Waiting in Line on One’s Service Time," Management Science, INFORMS, vol. 68(11), pages 7958-7976, November.
    15. Sheng Zhu & Xuege Han & Jinting Wang & Zhongbin Wang, 2026. "Performance evaluation and equilibrium strategies for a mixed priority queueing system," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-32, March.
    16. Isabel Kaluza & Guido Voigt & Friederike Paetz, 2024. "Empirical studies on the impact of booking status on customers’ choice behavior in online appointment systems," Journal of Business Economics, Springer, vol. 94(2), pages 187-224, February.
    17. Sezer Ülkü & Chris Hydock & Shiliang Cui, 2020. "Making the Wait Worthwhile: Experiments on the Effect of Queueing on Consumption," Management Science, INFORMS, vol. 66(3), pages 1149-1171, March.
    18. 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.
    19. 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.
    20. Jian Liu & Yongpin Zhou & Jian Chen & Peng Li, 2024. "Reference Dependence in Queue Design and Pricing Strategies," Service Science, INFORMS, vol. 16(4), pages 272-296, December.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:inm:ormsom:v:26:y:2024:i:2:p:775-795. 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.