|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10302
|
| タイトル: | The Voronoi game on graphs and its complexity |
| 著者: | Teramoto, Sachio
Demaine, Erik D.
Uehara, Ryuhei |
| キーワード: | graph algorithms
Voronoi Game
NP-completeness
PSPACE-completeness |
| 発行日: | 2011-08 |
| 出版者: | Journal of Graph Algorithms and Applications |
| 誌名: | Journal of Graph Algorithms and Applications |
| 巻: | 15 |
| 号: | 4 |
| 開始ページ: | 485 |
| 終了ページ: | 501 |
| 抄録: | 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 isintractable 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. |
| Rights: | Copyright (C) 2011 Journal of Graph Algorithms and Applications. Sachio Teramoto, Erik D. Demaine, and Ryuhei Uehara, Journal of Graph Algorithms and Applications, 15(4), 2011, 485-501. |
| URI: | http://hdl.handle.net/10119/10302 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 17134.pdf | | 242Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
