The one-round Voronoi game replayed

DOI10.1016/j.comgeo.2004.05.005zbMath1068.65035arXivcs/0305016OpenAlexW2144232842MaRDI QIDQ705543

Sándor P. Fekete, Henk G. Meijer

Publication date: 31 January 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0305016

zbMATH Keywords

game theoryVoronoi diagramcomputational geometryNP-hardnesscompetitive facility locationVoronoi game2-person gamesoptimal play

Mathematics Subject Classification ID

2-person games (91A05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80) Combinatorial games (91A46)

Related Items (14)

The discrete Voronoi game in \(\mathbb{R}^2\) ⋮ Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand ⋮ On the Performances of Nash Equilibria in Isolation Games ⋮ Optimal strategies for the one-round discrete Voronoi game on a line ⋮ Voronoi games using geodesics ⋮ Rectilinear Voronoi games with a simple rectilinear obstacle in plane ⋮ On the performances of Nash equilibria in isolation games ⋮ Voronoi game on graphs ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Maximum Neighbour Voronoi Games ⋮ The 1-dimensional discrete Voronoi game ⋮ Voronoi game on polygons ⋮ The isolation game: a game of distances

Cites Work

• Unnamed Item
• Unnamed Item
• Existence theory for spatially competitive network facility location models
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Competitive spatial models
• The one-round Voronoi game
• Competitive facility location: the Voronoi game
• GO Is Polynomial-Space Hard
• Planar Formulae and Their Uses
• Competitive Location Models: A Framework and Bibliography
• On the continuous Weber and k -median problems (extended abstract)
• Algorithms and Data Structures

This page was built for publication: The one-round Voronoi game replayed