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

Coverage, Coarseness, and Classification: Determinants of Social Efficiency in Priority Queues

Author

Listed:
  • Itai Gurvich

    (Cornell School of Operations Research and Information Engineering and Cornell Tech, New York, New York 10044)

  • Martin A. Lariviere

    (Kellogg School of Management, Northwestern University, Evanston Illinois 60208)

  • Can Ozkan

    (Gap Inc., San Francisco, California 94105)

Abstract

Customers often resent priority queues even though priorities are often necessary to maximize either social welfare or revenue. Consequently, it is useful to consider the level of social inefficiency introduced when the design of a priority scheme is turned over to a revenue-maximizing firm. In this paper we study how the priority scheme chosen by a revenue-maximizing firm differs from the one a social planner would use. We study a single-server queue with customers who draw their valuations from a continuous distribution and have a per-period waiting cost that is proportional to their realized valuations. The decision maker must post a menu offering a finite number of waiting time-price pairs. There are then three dimensions on which a revenue maximizer and social planner can differ: coverage (i.e., how many customers in total to serve), coarseness (i.e., how many classes of service to offer), and classification (i.e., how to map customers to priority levels). We show that differences between the decision-makers’ priority policies are all about classification. Both are content to offer very coarse schemes with just two priority levels, and they will have negligible differences in coverage. However, differences in classification are persistent. Further, a revenue maximizer may—relative to the social planner—have too few or too many high-priority customers. Whether the revenue maximizer overstuffs or understuffs the high-priority class depends on a measure of consumer surplus that is captured by the mean residual life function of the valuation distribution.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:ormnsc:v:65:y:2019:i:3:p:1061-1075
    DOI: 10.1287/mnsc.2017.2987
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/mnsc.2017.2987
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2017.2987?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. Ehlers, Lars & Erdil, Aytek, 2010. "Efficient assignment respecting priorities," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1269-1282, May.
    4. 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.
    5. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    6. 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.
    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. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    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. Ioannis Stamatopoulos & Christos Tzamos, 2019. "Design and Dynamic Pricing of Vertically Differentiated Inventories," Management Science, INFORMS, vol. 65(9), pages 4222-4241, September.
    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. Yiwei Chen & Cong Shi, 2019. "Joint Pricing and Inventory Management with Strategic Customers," Operations Research, INFORMS, vol. 67(6), pages 1610-1627, November.
    6. 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.
    7. 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.
    8. 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.

    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. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    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. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    4. Xu Yong & Liu Jian & Ma Baomei & Zhang Shuai, 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.
    5. 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.
    6. İşlier, Zeynep Gökçe & Güllü, Refik, 2024. "On strategic customers with correlated utility attributes: Effects and information benefits," European Journal of Operational Research, Elsevier, vol. 313(1), pages 258-269.
    7. 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.
    8. 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.
    9. Pavlin, J. Michael, 2017. "Dual bounds of a service level assignment problem with applications to efficient pricing," European Journal of Operational Research, Elsevier, vol. 262(1), pages 239-250.
    10. 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.
    11. 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.
    12. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.
    13. 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.
    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. 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.
    16. Yiwei Chen & Vivek F. Farias & Nikolaos Trichakis, 2019. "On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers," Management Science, INFORMS, vol. 65(12), pages 5535-5555, December.
    17. Vibhanshu Abhishek & Mustafa Dogan & Alexandre Jacquillat, 2021. "Strategic Timing and Dynamic Pricing for Online Resource Allocation," Management Science, INFORMS, vol. 67(8), pages 4880-4907, August.
    18. 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.
    19. 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.
    20. 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.

    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:65:y:2019:i:3:p:1061-1075. 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.