Abstract
We consider a competitive facility location problem on a network, in which consumers are located on the vertices and wish to connect to the nearest facility. Knowing this, competitive players locate their facilities on vertices that capture the largest possible market share. In 1991, Eiselt and Laporte established the first relation between Nash equilibria of a facility location game in a duopoly and the solutions to the 1-median problem. They showed that an equilibrium always exists in a tree because a location profile is at equilibrium if and only if both players select a 1-median of that tree [4]. In this work, we further explore the relations between the solutions to the 1-median problem and the equilibrium profiles. We show that if an equilibrium in a cycle exists, both players must choose a solution to the 1-median problem. We also obtain the same property for some other classes of graphs such as quasi-median graphs, median graphs, Helly graphs, and strongly-chordal graphs. Finally, we prove the converse for the latter class, establishing that, as for trees, any median of a strongly-chordal graph is a winning strategy that leads to an equilibrium.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bandelt, H., Chepoi, V.: Graphs with connected medians. SIAM J. Discret. Math. 15(2), 268–282 (2002)
Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 25 (1961)
Dürr, C., Thang, N.K.: Nash Equilibria in Voronoi Games on Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 17–28. Springer, Heidelberg (2007)
Eiselt, H.A., Laporte, G.: Locational equilibrium of two players on a tree. Recherche Operationnelle 25(1) (1991)
Eiselt, H.A., Laporte, G., Thisse, J.: Competitive location models: A framework and bibliography. Transportation Science 27(1), 44–54 (1993)
Gur, Y., Stier-Moses, N.: A facility location problem under competition. In: Proc. Workshop on The Economics of Networks, Systems, and Computation (2011)
Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 12(3), 450–459 (1964)
Hotelling, H.: Stability in competition. The Economic Journal 39, 41–57 (1929)
Kariv, O., Hakimi, S.L.: An algorithmic approach to networks location problems. I: The p-centers. SIAM Journal on Applied Mathematics 37, 511–538 (1979)
Lee, H., Chang, G.J.: The w-median of a connected strongly chordal graph. Journal of Graph Theory 18(7), 673–680 (1994)
Mavronicolas, M., Monien, B., Papadopoulou, V., Schoppmann, F.: Voronoi games on cycle graphs. In: Proc. Mathematical Foundations of Computer Science, pp. 503–514 (2008)
Slater, P.J.: Medians of arbitrary graphs. Journal of Graph Theory 4(4), 389–392 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saban, D., Stier-Moses, N. (2012). The Competitive Facility Location Problem in a Duopoly: Connections to the 1-Median Problem. In: Goldberg, P.W. (eds) Internet and Network Economics. WINE 2012. Lecture Notes in Computer Science, vol 7695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35311-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-35311-6_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35310-9
Online ISBN: 978-3-642-35311-6
eBook Packages: Computer ScienceComputer Science (R0)