The Voronoi game on graphs and its complexity
Name
Demaine_The voronoi.pdf
Size
129.09 KB
Format
Adobe PDF
Checksum (MD5)
f1221cc13b541076f170c003eff14e07
Author(s)
Teramoto, Sachio
Demaine, Erik D.
Uehara, Ryuhei
Date Issued
August 2011
Journal
Journal of Graph Algorithms and Applications
Publisher
Department of Computer Science, Brown University
Citation
Teramoto, Sachio, Erik D. Demaine, and Ryuhei Uehara. “The Voronoi Game on Graphs and Its Complexity.” Journal of Graph Algorithms and Applications 15, no. 4 (2011): 485–501.
Version
Author's final manuscript
Abstract
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is played on a continuous domain, and only two special cases (one-dimensional case and one-round case) are well investigated. We introduce the discrete Voronoi game in which the game arena is given as a graph. We first analyze the game when the arena is a large complete k-ary tree, and give an optimal strategy. When both players play optimally, the first player wins when k is odd, and the game ends in a tie for even k. Next we show that the discrete Voronoi game is intractable in general. Even for the one-round case in which the strategy adopted by the first player consist of a fixed single node, deciding whether the second player can win is NP-complete. We also show that deciding whether the second player can win is PSPACE-complete in general.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.7155/jgaa.00235
