IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v67y2021i11p6803-6821.html
   My bibliography  Save this article

A Model of Queue Scalping

Author

Listed:
  • Luyi Yang

    (Haas School of Business, University of California, Berkeley, Berkeley, California 94720)

  • Zhongbin Wang

    (Business School, Nankai University, Tianjin 300071, China)

  • Shiliang Cui

    (McDonough School of Business, Georgetown University, Washington, District of Columbia 20057)

Abstract

Recent years have witnessed the rise of queue scalping in congestion-prone service systems. A queue scalper has no material interest in the primary service but proactively enters the queue in hopes of selling his spot later. This paper develops a queueing-game-theoretic model of queue scalping and generates the following insights. First, we find that queues with either a very small or very large demand volume may be immune to scalping, whereas queues with a nonextreme demand volume may attract the most scalpers. Second, in the short run, when capacity is fixed, the presence of queue scalping often increases social welfare and can increase or reduce system throughput, but it tends to reduce consumer surplus. Third, in the long run, the presence of queue scalping motivates a welfare-maximizing service provider to adjust capacity using a “pull-to-center” rule, increasing (respectively, reducing) capacity if the original capacity level is low (respectively, high). When the service provider responds by expanding capacity, the presence of queue scalping can increase social welfare, system throughput, and even consumer surplus in the long run, reversing its short-run detrimental effect on customers. Despite these potential benefits, such capacity expansion does little to mitigate scalping and may only generate more scalpers in the queue. Finally, we compare and contrast queue scalping with other common mechanisms in practice—namely, (centralized) pay-for-priority, line sitting, and callbacks.

Suggested Citation

  • Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
  • Handle: RePEc:inm:ormnsc:v:67:y:2021:i:11:p:6803-6821
    DOI: 10.1287/mnsc.2020.3865
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2020.3865
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2020.3865?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. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
    2. Leonard Kleinrock, 1967. "Optimum Bribing for Queue Position," Operations Research, INFORMS, vol. 15(2), pages 304-318, April.
    3. 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.
    4. Xuanming Su, 2010. "Optimal Pricing with Speculators and Strategic Consumers," Management Science, INFORMS, vol. 56(1), pages 25-40, January.
    5. Luyi Yang & Laurens Debo & Varun Gupta, 2017. "Trading Time in a Congested Environment," Management Science, INFORMS, vol. 63(7), pages 2377-2395, July.
    6. Larry Karp & Jeffrey M. Perloff, 2005. "When Promoters Like Scalpers," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 14(2), pages 477-508, June.
    7. Alex Gershkov & Paul Schweinzer, 2010. "When queueing is better than push and shove," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
    8. 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.
    9. Paulo Oliveira & Nuria Torrado, 2015. "On proportional reversed failure rate class," Statistical Papers, Springer, vol. 56(4), pages 999-1013, November.
    10. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    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. Yao Cui & Izak Duenyas & Özge Şahin, 2014. "Should Event Organizers Prevent Resale of Tickets?," Management Science, INFORMS, vol. 60(9), pages 2160-2179, September.
    13. Ehud Kalai & Morton I. Kamien & Michael Rubinovitch, 1992. "Optimal Service Speeds in a Competitive Environment," Management Science, INFORMS, vol. 38(8), pages 1154-1163, August.
    14. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    15. Rafael Hassin, 1995. "Decentralized Regulation of a Queue," Management Science, INFORMS, vol. 41(1), pages 163-173, January.
    16. Gérard P. Cachon & Fuqiang Zhang, 2007. "Obtaining Fast Service in a Queueing System via Performance-Based Allocation of Demand," Management Science, INFORMS, vol. 53(3), pages 408-420, March.
    17. 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.
    18. Lui, Francis T, 1985. "An Equilibrium Queuing Model of Bribery," Journal of Political Economy, University of Chicago Press, vol. 93(4), pages 760-781, August.
    19. 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.
    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. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Luyi Yang & Laurens Debo & Varun Gupta, 2017. "Trading Time in a Congested Environment," Management Science, INFORMS, vol. 63(7), pages 2377-2395, July.
    8. 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.
    9. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
    10. 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.
    11. 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.
    12. 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.
    13. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    14. 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.
    15. Bradford, Richard M., 1996. "Pricing, routing, and incentive compatibility in multiserver queues," European Journal of Operational Research, Elsevier, vol. 89(2), pages 226-236, March.
    16. Xu Yong & Liu Jian & Zhang Shuai & Ma Baomei, 2018. "Service Mechanism and Pricing Based on Fairness Preference of Customers in Queuing System," Journal of Systems Science and Information, De Gruyter, vol. 6(6), pages 481-494, December.
    17. Sarang Deo & Itai Gurvich, 2011. "Centralized vs. Decentralized Ambulance Diversion: A Network Perspective," Management Science, INFORMS, vol. 57(7), pages 1300-1319, July.
    18. Zhou, Yu & Gao, Xiang & Luo, Suyuan & Xiong, Yu & Ye, Niangyue, 2022. "Anti-Counterfeiting in a retail Platform: A Game-Theoretic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    19. 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.
    20. 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.

    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:ormnsc:v:67:y:2021:i:11:p:6803-6821. 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.