Sciweavers

CIG
2006
IEEE

Voronoi game on graphs and its complexity

13 years 9 months ago
Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case and 1-round case) are well investigated. We introduce the discrete Voronoi game of which the game arena is given as a graph. We first show the best strategy when the game arena is a large complete k-ary tree. Next we show that the discrete Voronoi game is intractable in general. Even in 1-round case, and the place occupied by the first player is fixed, the game is NP-complete in general. We also show that the game is PSPACE-complete in general case. Key words: Voronoi Game, NP-completeness, PSPACE-completeness.
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
Added 10 Jun 2010
Updated 10 Jun 2010
Type Conference
Year 2006
Where CIG
Authors Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
Comments (0)