• Article  

      Nash equilibria for voronoi games on transitive graphs 

      Feldmann, R.; Mavronicolas, Marios; Monien, Burkhard (2009)
      In a Voronoi game, each of κ≥2 players chooses a vertex in a graph G=〈V(G), E(G)〉. The utility of a player measures her Voronoi cell: the set of vertices that are closest to her chosen vertex than to that of another player. ...
    • Article  

      Voronoi games on cycle graphs 

      Mavronicolas, Marios; Monien, Burkhard; Lesta, Vicky Papadopoulou; Schoppmann, F. (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 ...