Voronoi Game on a Path

The Voronoi game is a two-person perfect information game modeling a competitive facility location. The original version of the game is played on a continuous domain. Only two special cases (1-dimensional case and 1-round case) have been extensively investigated. Recently, the discrete Voronoi game of which the game arena is given as a graph was introduced. In this note, we give a complete analysis of the discrete Voronoi game on a path. There are drawing strategies for both the first and the second players, except for some trivial cases.

[1]  Jirí Matousek,et al.  The One-Round Voronoi Game , 2004, Discret. Comput. Geom..

[2]  Erik D. Demaine,et al.  Voronoi game on graphs and its complexity , 2006, 2006 IEEE Symposium on Computational Intelligence and Games.

[3]  Otfried Cheong,et al.  Competitive facility location: the Voronoi game , 2004, Theor. Comput. Sci..

[4]  Christoph Dürr,et al.  Nash Equilibria in Voronoi Games on Graphs , 2007, ESA.

[5]  Sándor P. Fekete,et al.  The one-round Voronoi game replayed , 2005, Comput. Geom..