• 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. ...