Voronoi Games on Cycle Graphs

@inproceedings{Mavronicolas2008VoronoiGO,
  title={Voronoi Games on Cycle Graphs},
  author={Marios Mavronicolas and Burkhard Monien and Vicky Papadopoulou Lesta and Florian Schoppmann},
  booktitle={MFCS},
  year={2008}
}
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… CONTINUE READING