Voronoi Game on a Path
スポンサーリンク
概要
- 論文の詳細を見る
The Voronoi game is a two-person perfect informationgame modeling a competitive facility location. The originalversion 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 ofwhich 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.
- 電子情報通信学会の論文
- 2011-06-01
著者
-
Uehara Ryuhei
Japan Advanced Inst. Sci. And Technol. Nomi‐shi Jpn
-
Uehara Ryuhei
School Of Information Science Jaist
-
SAITOH Toshiki
Japan Advanced Institute of Science and Technology
-
KIYOMI Masashi
Japan Advanced Institute of Science and Technology
-
Kiyomi Masashi
Japan Advanced Inst. Sci. And Technol. Nomi‐shi Jpn
-
KIYOMI Masashi
School of Information Science, JAIST
-
SAITOH Toshiki
ERATO, MINATO Discrete Structure Manipulation System Project, JST
-
Saitoh Toshiki
Erato Minato Discrete Structure Manipulation System Project Jst
-
Kiyomi Masashi
School Of Information Science Jaist
-
UEHARA Ryuhei
School of Information Science
関連論文
- Bipartite powers of interval bigraphs
- Random Generation and Enumeration of Proper Interval Graphs
- Generating Chordal Graphs Included in Given Graphs
- Longest Path Problems on Ptolemaic Graphs
- FOREWORD
- The complexity of free flood filling games (コンピュテーション)
- Voronoi Game on a Path
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem (コンピュテーション)
- NP-completeness of generalized Kaboozle
- Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
- Computational Complexity of Piano-Hinged Dissections
- Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs