Location Games on Networks: Existence and Efficiency of Equilibria

References

• Anshelevich E, Dasgupta A, Kleinberg J, Tardos É, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4):1602–1623.Crossref, Google Scholar
• Bollobás B, Stern N (1972) The optimal structure of market areas. J. Econom. Theory 4(2):174–179.Crossref, Google Scholar
• d’Aspremont C, Gabszewicz JJ, Thisse JF (1979) On Hotelling’s “Stability in competition.” Econometrica 47(5):1145–1150.Crossref, Google Scholar
• Downs A (1957) An Economic Theory of Democracy (Harper and Row, New York).Google Scholar
• Dürr C, Thang NK (2007) Nash equilibria in Voronoi games on graphs. Arge L, Hoffmann M, Welzl E, eds. Algorithms—ESA 2007. Lecture Notes in Computer Science, Vol. 4698 (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• Eaton BC, Lipsey RG (1975) The principle of minimum differentiation reconsidered: Some new developments in the theory of spatial competition. Rev. Econom. Stud. 42(1):27–49.Crossref, Google Scholar
• Eiselt HA, Laporte G (1993) The existence of equilibria in the 3-facility Hotelling model in a tree. Transportation Sci. 27(1):39–43.Link, Google Scholar
• Heijnen P, Soetevent AR (2018) Price competition on graphs. J. Econom. Behav. Organ. 146:161–179.Crossref, Google Scholar
• Hotelling H (1929) Stability in competition. Econom. J. 39(153):41–57.Google Scholar
• Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. STACS 99 (Trier). Lecture Notes in Computer Science, Vol. 1563 (Springer, Berlin), 404–413.Crossref, Google Scholar
• Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput. Sci. Rev. 3(2):65–69.Crossref, Google Scholar
• Lösch A (1954) The Economics of Location (Yale University Press, New Haven, CT). https://archive.org/details/economicsoflocat00ls.Google Scholar
• Marshall AW, Olkin I, Arnold BC (2011) Inequalities: Theory of Majorization and Its Applications, 2nd ed. (Springer, New York). ISBN 978-0-387-40087-7.Crossref, Google Scholar
• Mavronicolas M, Monien B, Papadopoulou VG, Schoppmann F (2008) Voronoi games on cycle graphs. Mathematical Foundations of Computer Science 2008. Lecture Notes in Computer Science, Vol. 5162 (Springer, Berlin), 503–514.Crossref, Google Scholar
• Pálvölgyi D (2011) Hotelling on graphs. http://media.coauthors.net/konferencia/conferences/5/palvolgyi.pdf, Mimeo.Google Scholar
• Papadimitriou C (2001) Algorithms, games, and the Internet. Proc. 33rd Annual ACM Sympos. Theory Comput. (ACM, New York), 749–753.Google Scholar
• Roughgarden T (2015) Intrinsic robustness of the price of anarchy. J. ACM 62(5):Article No. 32.Crossref, Google Scholar
• Salop SC (1979) Monopolistic competition with outside goods. Bell J. Econom. 10(1):141–156.Crossref, Google Scholar
• Schulz AS, Stier-Moses N (2003) On the performance of user equilibria in traffic networks. Proc. 14th Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’03 (Society for Industrial and Applied Mathematics, Philadelphia), 86–87.Google Scholar
• Vetta A (2002) Nash equilibria in competitive societies with applications to facility location, traffic routing and auctions. Proc. 43rd Sympos. Foundations of Comput. Sci. (IEEE Computer Society, Washington, DC), 416–425.Google Scholar