| Presentation | 2017-12-21 An optimal strategy of the second player for the 1-round voronoi game on trees Akihiro Sugimoto, Toshiki Saitoh, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Voronoi game is an encampment game which is played on a plane. The game is expected to be applied to a model of competitive facility location problem. Each player puts $m$ marks (facility) on the plane alternately. These 2$m$ facilities partition the plane into 2$m$ regions according to nearest-neighbor rule. This partitioned plane is called Voronoi diagrams. Each player acquires the Voronoi regions which are formed by the Voronoi diagram. The player who acquires the larger area is the winner. Voronoi game on graphs is a kind of Voronoi game which is played on a discrete structure. One-round Voronoi game is the case that the first player selects $m$ vertices, and then the second player selects another $m$ vertices. In this paper, given a tree and selected verices by the first player on one round Voronoi game, we present a polynomial time algorithm which finds the optimal locations for the second player by dynamic programming. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Voronoi game / Dynamic programming / Polynomial time algorithm |
| Paper # | ISEC2017-77,COMP2017-31 |
| Date of Issue | 2017-12-14 (ISEC, COMP) |
| Conference Information | |
| Committee | ISEC / COMP |
|---|---|
| Conference Date | 2017/12/21(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Eikokuji Campus, Kochi University of Technology |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Kazuto Ogawa(NHK) / Hiro Ito(Univ. of Electro-Comm.) |
| Vice Chair | Atsushi Fujioka(Kanagawa Univ.) / Shiho Moriai(NICT) / Yushi Uno(Osaka Pref. Univ.) |
| Secretary | Atsushi Fujioka(Tohoku Univ.) / Shiho Moriai(Tokai Univ.) / Yushi Uno(Seikei Univ.) |
| Assistant | Keita Emura(NICT) / Yuichi Komano(TOSHIBA) / Yuuji Suga(IIJ) |
| Paper Information | |
| Registration To | Technical Committee on Information Security / Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An optimal strategy of the second player for the 1-round voronoi game on trees |
| Sub Title (in English) | |
| Keyword(1) | Voronoi game |
| Keyword(2) | Dynamic programming |
| Keyword(3) | Polynomial time algorithm |
| 1st Author's Name | Akihiro Sugimoto |
| 1st Author's Affiliation | Kobe University(Kobe Univ.) |
| 2nd Author's Name | Toshiki Saitoh |
| 2nd Author's Affiliation | Kyushu Institute of Technology(Kyushu Inst. of Tech.) |
| Date | 2017-12-21 |
| Paper # | ISEC2017-77,COMP2017-31 |
| Volume (vol) | vol.117 |
| Number (no) | ISEC-369,COMP-370 |
| Page | pp.pp.33-39(ISEC), pp.33-39(COMP), |
| #Pages | 7 |
| Date of Issue | 2017-12-14 (ISEC, COMP) |