IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/901.html
   My bibliography  Save this paper

Optimal Service Speeds in a Competitive Environment

Author

Listed:
  • Ehud Kalai

Abstract

This is a study of the economic behavior of vendors of service in competition. A simple model with two competing exponential servers and Poisson arrivals is considered. Each server is free to choose his own service rate at a cost (per time unit) that is strictly convex and increasing. There is a fixed reward to a server for each customer that he serves. The model is designed to study one specific aspect of competition. Namely, competition in speed of service as a means for capturing a larger market share in order to maximize long run expected profit per time unit. A two person strategic game is formulated an its solutions are characterized. Depending on the revenue per customer served and on the cost of maintaining service rates, the following three situations may arise. (i) a unique symmetric strategic (Nash) equilibrium in which expected waiting time is infinite; (ii) a unique symmetric strategic equilibrium in which expected waiting time is finite; and (iii) several, non symmetric strategic equilibria with infinite expected waiting time. An explicit expression for the market share of each server as a function of the service rates of the two servers is also given.

Suggested Citation

  • Ehud Kalai, 1990. "Optimal Service Speeds in a Competitive Environment," Discussion Papers 901, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    • Handle: RePEc:nwu:cmsems:901
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/901.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Colin E. Bell & Shaler Stidham, Jr., 1983. "Individual versus Social Optimization in the Allocation of Customers to Alternative Servers," Management Science, INFORMS, vol. 29(7), pages 831-839, July.
    2. Teghem, J., 1986. "Control of the service process in a queueing system," European Journal of Operational Research, Elsevier, vol. 23(2), pages 141-158, February.
    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. Weng, Z. Kevin, 1996. "Manufacturing lead times, system utilization rates and lead-time-related demand," European Journal of Operational Research, Elsevier, vol. 89(2), pages 259-268, March.
    2. Li Li & Li Jiang & Liming Liu, 2012. "Service and Price Competition When Customers Are Naive," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 747-760, July.
    3. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    4. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.
    5. Haque, Lani & Armstrong, Michael J., 2007. "A survey of the machine interference problem," European Journal of Operational Research, Elsevier, vol. 179(2), pages 469-482, June.
    6. Shoshana Anily & Moshe Haviv, 2010. "Cooperation in Service Systems," Operations Research, INFORMS, vol. 58(3), pages 660-673, June.
    7. Zhang, Zhe G. & Tian, Naishuo, 2004. "An analysis of queueing systems with multi-task servers," European Journal of Operational Research, Elsevier, vol. 156(2), pages 375-389, July.
    8. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    9. Corine M. Laan & Judith Timmer & Richard J. Boucherie, 2021. "Non-cooperative queueing games on a network of single server queues," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 279-301, April.
    10. Wei Li & Attahiru Sule Alfa, 2000. "Optimal policies for M/M/m queue with two different kinds of (N, T)‐policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 240-258, April.
    11. Saif Benjaafar & Yanzhi Li & Dongsheng Xu & Samir Elhedhli, 2008. "Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 43-60, October.
    12. Albert Y. Ha, 2001. "Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements," Management Science, INFORMS, vol. 47(7), pages 915-930, July.
    13. R.E. Lillo, 2001. "Optimal control of an M/G/1 queue with impatient priority customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 201-209, April.
    14. Johansen, Soren Glud & Larsen, Christian, 2001. "Computation of a near-optimal service policy for a single-server queue with homogeneous jobs," European Journal of Operational Research, Elsevier, vol. 134(3), pages 648-663, November.
    15. Gérard P. Cachon & Patrick T. Harker, 2002. "Competition and Outsourcing with Scale Economies," Management Science, INFORMS, vol. 48(10), pages 1314-1333, October.
    16. George L. Vairaktarakis, 2013. "Noncooperative Games for Subcontracting Operations," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 148-158, September.
    17. Jonatha Anselmi, 2017. "Asymptotically optimal open-loop load balancing," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 245-267, December.
    18. Rob Shone & Vincent A. Knight & Paul R. Harper, 2020. "A conservative index heuristic for routing problems with multiple heterogeneous service facilities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 511-543, December.
    19. Michael Rubinovitch, 1983. "The Slow Server Problem," Discussion Papers 571, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    20. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:nwu:cmsems:901. 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: Fran Walker (email available below). General contact details of provider: https://edirc.repec.org/data/cmnwuus.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.