IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v304y2023i2p652-660.html
   My bibliography  Save this article

Charging more for priority via two-part tariff for accumulating priorities

Author

Listed:
  • Moshe, Shir
  • Oz, Binyamin

Abstract

We consider an unobservable M/G/1 queue with accumulating priorities and strategic customers who pay for priority accumulation rates. We show that when affine pricing is introduced, multiple equilibria may exist. This is in contrast to the standard linear pricing case where the equilibrium strategy is unique. Furthermore, a revenue-maximizing operator may generate more revenue under the optimal affine pricing than under linear pricing. In particular, we show that if the utilization level is not too high, no other combination of a priority scheme and pricing generates more revenue than the optimal affine pricing of accumulating priorities.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:304:y:2023:i:2:p:652-660
    DOI: 10.1016/j.ejor.2022.04.042
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722003563
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.04.042?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. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    2. 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.
    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. Sinha, Sudhir K. & Rangaraj, N. & Hemachandra, N., 2010. "Pricing surplus server capacity for mean waiting time sensitive customers," European Journal of Operational Research, Elsevier, vol. 205(1), pages 159-171, August.
    5. Moshe Haviv & Liron Ravner, 2016. "Strategic bidding in an accumulating priority queue: equilibrium analysis," Annals of Operations Research, Springer, vol. 244(2), pages 505-523, September.
    6. L. Kleinrock, 1964. "A delay dependent queue discipline," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 11(3‐4), pages 329-341, September.
    7. K. R. Balachandran, 1972. "Purchasing Priorities in Queues," Management Science, INFORMS, vol. 18(5-Part-1), pages 319-326, January.
    8. Edelson, Noel M & Hildebrand, David K, 1975. "Congestion Tolls for Poisson Queuing Processes," Econometrica, Econometric Society, vol. 43(1), pages 81-92, January.
    9. 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. Wengang Chen & Jiajia Chen & Bingyin Xu & Xinpeng Cong & Wenliang Yin, 2023. "Optimal Configuration of User-Side Energy Storage for Multi-Transformer Integrated Industrial Park Microgrid," Energies, MDPI, vol. 16(7), pages 1-15, March.

    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. 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.
    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. 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.
    4. 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.
    5. 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.
    6. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    7. repec:vuw:vuwscr:19111 is not listed on IDEAS
    8. Apostolos Burnetas, 2013. "Customer equilibrium and optimal strategies in Markovian queues in series," Annals of Operations Research, Springer, vol. 208(1), pages 515-529, September.
    9. 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.
    10. 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.
    11. Yu, Jianjun & Fang, Yanli & Zhong, Yuanguang & Zhang, Xiong & Zhang, Ruijie, 2022. "Pricing and quality strategies for an on-demand housekeeping platform with customer-intensive services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    12. 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.
    13. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    14. Moshe Haviv & Eyal Winter, 2020. "An optimal mechanism charging for priority in a queue," Papers 2002.06533, arXiv.org.
    15. Lian, Zhaotong & Gu, Xinhua & Wu, Jinbiao, 2016. "A re-examination of experience service offering and regular service pricing under profit maximization," European Journal of Operational Research, Elsevier, vol. 254(3), pages 907-915.
    16. 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.
    17. Zhou, Wenhui & Lian, Zhaotong & Wu, Jinbiao, 2014. "When should service firms provide free experience service?," European Journal of Operational Research, Elsevier, vol. 234(3), pages 830-838.
    18. Bodas, Tejas & Manjunath, D., 2019. "Revenue maximization in service systems with heterogeneous customers," European Journal of Operational Research, Elsevier, vol. 278(2), pages 686-698.
    19. Nicos Savva & Tolga Tezcan & Özlem Yıldız, 2019. "Can Yardstick Competition Reduce Waiting Times?," Management Science, INFORMS, vol. 65(7), pages 3196-3215, July.
    20. Shone, Rob & Knight, Vincent A. & Williams, Janet E., 2013. "Comparisons between observable and unobservable M/M/1 queues with respect to optimal customer behavior," European Journal of Operational Research, Elsevier, vol. 227(1), pages 133-141.
    21. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.

    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:eee:ejores:v:304:y:2023:i:2:p:652-660. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.