Voronoi Games on Cycle Graphs

  • Marios Mavronicolas
  • Burkhard Monien
  • Vicky G. Papadopoulou
  • Florian Schoppmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5162)

Abstract

In a Voronoi game, each of a finite number of players chooses a point in some metric space. The utility of a player is the total measure of all points that are closer to him than to any other player, where points equidistant to several players are split up evenly among the closest players. In a recent paper, Dürr and Thang (2007) considered discrete Voronoi games on graphs, with a particular focus on pure Nash equilibria. They also looked at Voronoi games on cycle graphs with n nodes and k players. In this paper, we prove a new characterization of all Nash equilibria for these games. We then use this result to establish that Nash equilibria exist if and only if \(k \leq \frac{2n}3\) or k ≥ n. Finally, we give exact bounds of \(\frac 94\) and 1 for the prices of anarchy and stability, respectively.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, É., Wexler, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS 2004), pp. 295–304 (2004), doi:10.1109/FOCS.2004.68Google Scholar
  2. 2.
    Boulding, K.E.: Economic Analysis, 4th edn. Harper & Row, New York (1966)Google Scholar
  3. 3.
    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), http://arxiv.org/abs/cs.IT/0702054 CrossRefGoogle Scholar
  4. 4.
    Eaton, B.C., Lipsey, R.G.: The principle of minimum differentiation reconsidered: Some new developments in the theory of spatial competition. Review of Economic Studies 42(129), 27–49 (1975), http://www.jstor.org/stable/2296817 MATHGoogle Scholar
  5. 5.
    Eiselt, H.A., Laporte, G., Thisse, J.-F.: Competitive location models: A framework and bibliography. Transportation Science 27(1), 44–54 (1993)MATHCrossRefGoogle Scholar
  6. 6.
    Hotelling, H.: Stability in competition. Computational Geometry: Theory and Applications 39(153), 41–57 (1929)Google Scholar
  7. 7.
    Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  8. 8.
    Wendell, R.E., McKelvey, R.D.: New perspectives in competitive location theory. European Journal of Operational Research 6(2), 174–182 (1981)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Marios Mavronicolas
    • 1
  • Burkhard Monien
    • 2
  • Vicky G. Papadopoulou
    • 1
  • Florian Schoppmann
    • 2
    • 3
  1. 1.Department of Computer ScienceUniversity of CyprusNicosiaCyprus
  2. 2.Faculty of Computer Science, Electrical Engineering and MathematicsUniversity of PaderbornPaderbornGermany
  3. 3.International Graduate School of Dynamic Intelligent Systems 

Personalised recommendations