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

The principal-agent problem for service rate event-dependency

Author

Listed:
  • Legros, Benjamin

Abstract

This study aims to determine the cost of letting an agent adjust the service rate to the last realized event, being a customer arrival or a service completion. We study this question in a single-server queue under a principal-agent framework. The principal seeks to reduce the expected waiting time by incentivizing the agent to modify the service rate through a performance-based payout. We show that a large range of improvement is achievable by selecting event-dependent service rates. However, the agent’s payout can grow high in the realized improvement, suggesting to limit the use of incentives for event-dependent service rates to a bounded waiting time improvement. When the service rate after an arrival is contractible, the agent should be paid more in contexts with a low variability inter-arrival time. The opposite conclusion holds when the average service rate is contractible. Further, we provide a criterion to determine when it is optimal for the agent to accelerate after an arrival or after a service completion. Finally, we investigate the effect of event-dependency on customers’ fairness and abandonment.

Suggested Citation

  • Legros, Benjamin, 2022. "The principal-agent problem for service rate event-dependency," European Journal of Operational Research, Elsevier, vol. 297(3), pages 949-963.
    • Handle: RePEc:eee:ejores:v:297:y:2022:i:3:p:949-963
    DOI: 10.1016/j.ejor.2021.09.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721007955
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.09.020?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. Houyuan Jiang & Zhan Pang & Sergei Savin, 2012. "Performance-Based Contracts for Outpatient Medical Services," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 654-669, October.
    2. Baric{s} Ata & Shiri Shneorson, 2006. "Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates," Management Science, INFORMS, vol. 52(11), pages 1778-1791, November.
    3. Fabian Herweg & Daniel Muller & Philipp Weinschenk, 2010. "Binary Payment Schemes: Moral Hazard and Loss Aversion," American Economic Review, American Economic Association, vol. 100(5), pages 2451-2477, December.
    4. Moshe Haviv & Yoav Kerner, 2011. "The age of the arrival process in the G/M/1 and M/G/1 queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(1), pages 139-152, February.
    5. Carri W. Chan & Galit Yom-Tov & Gabriel Escobar, 2014. "When to Use Speedup: An Examination of Service Systems with Returns," Operations Research, INFORMS, vol. 62(2), pages 462-482, April.
    6. Binyamin Oz & Ivo Adan & Moshe Haviv, 2017. "A rate balance principle and its application to queueing models," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 95-111, October.
    7. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    8. Gerlinde Fellner & Matthias Sutter, 2009. "Causes, Consequences, and Cures of Myopic Loss Aversion – An Experimental Investigation," Economic Journal, Royal Economic Society, vol. 119(537), pages 900-916, April.
    9. Fangruo Chen & Guoming Lai & Wenqiang Xiao, 2016. "Provision of Incentives for Information Acquisition: Forecast-Based Contracts vs. Menus of Linear Contracts," Management Science, INFORMS, vol. 62(7), pages 1899-1914, July.
    10. Kristin Fridgeirsdottir & Sam Chiu, 2005. "A Note on Convexity of the Expected Delay Cost in Single-Server Queues," Operations Research, INFORMS, vol. 53(3), pages 568-570, June.
    11. Jennifer M. George & J. Michael Harrison, 2001. "Dynamic Control of a Queue with Adjustable Service Rate," Operations Research, INFORMS, vol. 49(5), pages 720-731, October.
    12. Ragavendran Gopalakrishnan & Sherwin Doroudi & Amy R. Ward & Adam Wierman, 2016. "Routing and Staffing When Servers Are Strategic," Operations Research, INFORMS, vol. 64(4), pages 1033-1050, August.
    13. Duane Christ & Benjamin Avi-Itzhak, 2002. "Strategic Equilibrium for a Pair of Competing Servers with Convex Cost and Balking," Management Science, INFORMS, vol. 48(6), pages 813-820, June.
    14. Xiaoyang Long & Javad Nasiry, 2020. "Wage Transparency and Social Comparison in Sales Force Compensation," Management Science, INFORMS, vol. 66(11), pages 5290-5315, November.
    15. Pengfei Guo & Christopher S. Tang & Yulan Wang & Ming Zhao, 2019. "The Impact of Reimbursement Policy on Social Welfare, Revisit Rate, and Waiting Time in a Public Healthcare System: Fee-for-Service Versus Bundled Payment," Service Science, INFORMS, vol. 21(1), pages 154-170, January.
    16. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    17. Sanjay Jain, 2012. "Self-Control and Incentives: An Analysis of Multiperiod Quota Plans," Marketing Science, INFORMS, vol. 31(5), pages 855-869, September.
    18. Z. Justin Ren & Yong-Pin Zhou, 2008. "Call Center Outsourcing: Coordinating Staffing Level and Service Quality," Management Science, INFORMS, vol. 54(2), pages 369-383, February.
    19. Ivo Adan & Onno Boxma & David Perry, 2005. "The G/M/1 queue revisited," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 437-452, December.
    20. Ravi Kumar & Mark E. Lewis & Huseyin Topaloglu, 2013. "Dynamic service rate control for a single‐server queue with Markov‐modulated arrivals," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(8), pages 661-677, December.
    21. Yong-Pin Zhou & Noah Gans, 1999. "A Single-Server Queue with Markov Modulated Service Times," Center for Financial Institutions Working Papers 99-40, Wharton School Center for Financial Institutions, University of Pennsylvania.
    22. Hung-Yuan Tu & Hillel Kumin, 1983. "Technical Note—A Convexity Result for a Class of GI / G /1 Queueing Systems," Operations Research, INFORMS, vol. 31(5), pages 948-950, October.
    23. Rajiv Lal & V. Srinivasan, 1993. "Compensation Plans for Single- and Multi-Product Salesforces: An Application of the Holmstrom-Milgrom Model," Management Science, INFORMS, vol. 39(7), pages 777-793, July.
    24. 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.
    25. Xia, Li, 2014. "Service rate control of closed Jackson networks from game theoretic perspective," European Journal of Operational Research, Elsevier, vol. 237(2), pages 546-554.
    26. Ke, Jau-Chuan & Wang, Kuo-Hsiung, 2002. "A recursive method for the N policy G/M/1 queueing system with finite capacity," European Journal of Operational Research, Elsevier, vol. 142(3), pages 577-594, November.
    27. 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.
    28. Benjamin Legros & Ali Devin Sezer, 2018. "Stationary analysis of a single queue with remaining service time-dependent arrivals," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 139-165, February.
    29. G. M. Laslett, 1975. "Characterising the Finite Capacity GI/M/1 Queue with Renewal Output," Management Science, INFORMS, vol. 22(1), pages 106-110, September.
    30. Xin Geng & Woonghee Tim Huh & Mahesh Nagarajan, 2015. "Fairness Among Servers When Capacity Decisions Are Endogenous," Production and Operations Management, Production and Operations Management Society, vol. 24(6), pages 961-974, June.
    31. Pourbabai, Behnam, 1990. "Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm," European Journal of Operational Research, Elsevier, vol. 46(3), pages 380-387, June.
    32. Richard R. Weber, 1983. "Technical Note—A Note on Waiting Times in Single Server Queues," Operations Research, INFORMS, vol. 31(5), pages 950-951, October.
    33. Shan Li & Kay-Yut Chen & Ying Rong, 2020. "The Behavioral Promise and Pitfalls in Compensating Store Managers," Management Science, INFORMS, vol. 66(10), pages 4899-4919, October.
    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. M. Nithya & Gyanendra Prasad Joshi & C. Sugapriya & S. Selvakumar & N. Anbazhagan & Eunmok Yang & Ill Chul Doo, 2022. "Analysis of Stochastic State-Dependent Arrivals in a Queueing-Inventory System with Multiple Server Vacation and Retrial Facility," Mathematics, MDPI, vol. 10(17), pages 1-29, August.

    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. Benjamin Legros, 2022. "The principal-agent problem for service rate event-dependency," Post-Print hal-03605421, HAL.
    2. 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.
    3. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    4. Benjamin Legros, 2021. "Age-based Markovian approximation of the G/M/1 queue," Post-Print hal-03605431, HAL.
    5. 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.
    6. Vincent Knight & Izabela Komenda & Jeff Griffiths, 2017. "Measuring the price of anarchy in critical care unit interactions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(6), pages 630-642, June.
    7. Wang, Haiyan & Olsen, Tava Lennon & Liu, Guiqing, 2018. "Service capacity competition with peak arrivals and delay sensitive customers," Omega, Elsevier, vol. 77(C), pages 80-95.
    8. Mor Armony & Guillaume Roels & Hummy Song, 2021. "Pooling Queues with Strategic Servers: The Effects of Customer Ownership," Operations Research, INFORMS, vol. 69(1), pages 13-29, January.
    9. Ying Xu & Alan Scheller-Wolf & Katia Sycara, 2015. "The Benefit of Introducing Variability in Single-Server Queues with Application to Quality-Based Service Domains," Operations Research, INFORMS, vol. 63(1), pages 233-246, February.
    10. Jinting Wang & Zhongbin Wang & Yunan Liu, 2020. "Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates," Operations Research, INFORMS, vol. 68(6), pages 1648-1667, November.
    11. Shone, Rob & Glazebrook, Kevin & Zografos, Konstantinos G., 2019. "Resource allocation in congested queueing systems with time-varying demand: An application to airport operations," European Journal of Operational Research, Elsevier, vol. 276(2), pages 566-581.
    12. Xianyi Wang & Xiaofang Wang & Hui He, 2021. "Contracts to Coordinate Healthcare Providers in the Telemedicine Referral System," Sustainability, MDPI, vol. 13(18), pages 1-25, September.
    13. Dimitrakopoulos, Y. & Burnetas, A.N., 2016. "Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control," European Journal of Operational Research, Elsevier, vol. 252(2), pages 477-486.
    14. Lauren Xiaoyuan Lu & Jan A. Van Mieghem & R. Canan Savaskan, 2009. "Incentives for Quality Through Endogenous Routing," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 254-273, July.
    15. Pengfei Guo & Christopher S. Tang & Yulan Wang & Ming Zhao, 2019. "The Impact of Reimbursement Policy on Social Welfare, Revisit Rate, and Waiting Time in a Public Healthcare System: Fee-for-Service Versus Bundled Payment," Service Science, INFORMS, vol. 21(1), pages 154-170, January.
    16. Kräkel, Matthias & Schöttner, Anja, 2016. "Optimal sales force compensation," Journal of Economic Behavior & Organization, Elsevier, vol. 126(PA), pages 179-195.
    17. Smirnov, Dmitry & Huchzermeier, Arnd, 2020. "Analytics for labor planning in systems with load-dependent service times," European Journal of Operational Research, Elsevier, vol. 287(2), pages 668-681.
    18. Wei, Lin & Chen, Menghan & Du, Shaofu & Zhang, Baofeng, 2022. "By-state fairness in selling to the newsvendor," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    19. Fengfeng Huang & Pengfei Guo & Yulan Wang, 2022. "Modeling Patients' Illness Perception and Equilibrium Analysis of Their Doctor Shopping Behavior," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1216-1234, March.
    20. Wallace J. Hopp & Seyed M. R. Iravani & Gigi Y. Yuen, 2007. "Operations Systems with Discretionary Task Completion," Management Science, INFORMS, vol. 53(1), pages 61-77, January.

    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:297:y:2022:i:3:p:949-963. 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.