Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-25T05:06:20.596Z Has data issue: false hasContentIssue false

Strategic equilibrium versus global optimum for a pair of competing servers

Published online by Cambridge University Press:  14 July 2016

Benjamin Avi-Itzhak*
Affiliation:
Rutgers University
Boaz Golany*
Affiliation:
Technion, Israel Institute of Technology
Uriel G. Rothblum*
Affiliation:
Technion, Israel Institute of Technology
*
Postal address: RUTCOR, Rutgers University, 640 Bartholomew Street, Piscataway, NJ 08854-8003, USA. Email address: [email protected]
∗∗Postal address: Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Haifa, 32000, Israel.
∗∗Postal address: Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Haifa, 32000, Israel.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Christ and Avi-Itzhak (2002) analyzed a queueing system with two competing servers who determine their service rates so as to optimize their individual utilities. The system is formulated as a two-person game; Christ and Avi-Itzhak proved the existence of a unique Nash equilibrium which is symmetric. In this paper, we explore globally optimal solutions. We prove that the unique Nash equilibrium is generally strictly inferior to a globally optimal solution and that optimal solutions are symmetric and require the servers to adopt service rates that are smaller than those occurring in equilibrium. Furthermore, given a symmetric globally optimal solution, we show how to impose linear penalties on the service rates so that the given optimal solution becomes a unique Nash equilibrium. When service rates are not observable, we show how the same effect is achieved by imposing linear penalties on a corresponding signal.

Type
Short Communications
Copyright
© Applied Probability Trust 2006 

References

Beckmann, M., McGuire, C. B. and Winsten, C. B. (1956). Studies in the Economics of Transportation. Yale University Press.Google Scholar
Cachon, G. P. and Netessine, S. (2004). Game theoretic applications in supply chain analysis. In Handbook of Quantitative Supply Chain Analysis: Modeling in the eBusiness Era, eds Wu, S. D., Simchi-Levi, D. and Shen, Z., Kluwer, Dordrecht, pp. 1366.Google Scholar
Christ, D. and Avi-Itzhak, B. (2002). Strategic equilibrium for a pair of competing servers with convex cost and balking. Manag. Sci. 48, 813820.CrossRefGoogle Scholar
Golany, B. and Rothblum, U. G. (2006). Inducing coordination in supply chains through linear reward schemes. Naval Res. Logistics 53, 115.Google Scholar
Hardin, G. (1968). The tragedy of the commons. Science 162, 12431248.Google Scholar
Hassin, R. and Haviv, M. (2003). To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems. Kluwer, Norwell, MA.Google Scholar
Johari, R. and Tsitsiklis, J. N. (2004). Efficiency loss in a network resource allocation game. Math. Operat. Res. 29, 407435.Google Scholar
Kalai, E., Kamien, M. I. and Rubinovitz, M. (1992). Optimal service speeds in a competitive environment. Manag. Sci. 38, 11541163.Google Scholar
Naor, P. (1969). The regulation of queue size by levying tolls. Econometrica 37, 1524.Google Scholar
Rapoport, A. and Chammah, A. M. (1965). Prisoner's Dilemma. University of Michigan Press.CrossRefGoogle ScholarPubMed
Rothblum, U. G. (2005). Optimality vs. equilibrium: inducing stability by linear rewards and penalties. Unpublished manuscript.Google Scholar