The Voronoi game on graphs and its complexity
From MaRDI portal
Publication:2865040
DOI10.7155/jgaa.00235zbMath1276.05076OpenAlexW2040439396MaRDI QIDQ2865040
Erik D. Demaine, Ryuhei Uehara, Sachio Teramoto
Publication date: 28 November 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00235
2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (15)
The discrete Voronoi game in \(\mathbb{R}^2\) ⋮ Competitive Diffusion on Weighted Graphs ⋮ Nash equilibrium structure of Cox process Hotelling games ⋮ Rectilinear Voronoi games with a simple rectilinear obstacle in plane ⋮ Improved bounds for discrete Voronoi games ⋮ Unnamed Item ⋮ Voronoi game on graphs ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Pure-strategy Nash equilibria on competitive diffusion games ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Voronoi game on polygons ⋮ The one-round multi-player discrete Voronoi game on grids and trees ⋮ Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm ⋮ Finding Safe Strategies for Competitive Diffusion on Trees ⋮ The discrete Voronoi game in a simple polygon
This page was built for publication: The Voronoi game on graphs and its complexity
