The one-round Voronoi game replayed (Q705543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2131600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The one-round Voronoi game replayed |
scientific article; zbMATH DE number 2131600 |
Statements
The one-round Voronoi game replayed (English)
0 references
31 January 2005
0 references
The authors resolve a number of problems raised by \textit{O. Cheong, S. Har-Peled, N. Linial} and \textit{J. Matousek} [The one-round Voronoi game, Discrete Comput. Geom. 31, 125--138 (2004; Zbl 1079.91010)]. A precise characterisation of the outcome of the game for optimal play is given. Furthermore, complexity aspects of the game are studied for a particular case.
0 references
Voronoi game
0 references
optimal play
0 references
Voronoi diagram
0 references
game theory
0 references
computational geometry
0 references
competitive facility location
0 references
2-person games
0 references
NP-hardness
0 references
0.8923705220222473
0 references
0.8477873206138611
0 references
0.841633677482605
0 references
0.8307009339332581
0 references
0.8138569593429565
0 references
