Optimal strategies for the one-round discrete Voronoi game on a line
From MaRDI portal
Publication:386423
DOI10.1007/s10878-011-9447-6zbMath1302.91006MaRDI QIDQ386423
Sandip Das, Bhaswar B. Bhattacharya, Aritra Banik
Publication date: 9 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9447-6
91A05: 2-person games
91A80: Applications of game theory
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
90B80: Discrete location and assignment
91A46: Combinatorial games
91B72: Spatial models in economics
Related Items
The one-round multi-player discrete Voronoi game on grids and trees, Voronoi games using geodesics, Rectilinear Voronoi games with a simple rectilinear obstacle in plane, Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions, The discrete Voronoi game in \(\mathbb{R}^2\), The 1-dimensional discrete Voronoi game, Geometric spanner games, On the sequential price of anarchy of isolation games
Cites Work
- Unnamed Item
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
- The one-round Voronoi game replayed
- Existence theory for spatially competitive network facility location models
- \((r,p)\)-centroid problems on paths and trees
- Facility location problems in the plane based on reverse nearest neighbor queries
- Competitive spatial models
- The one-round Voronoi game
- Competitive facility location: the Voronoi game
- Finding a guard that sees most and a shop that sells most
- Competitive Location Models: A Framework and Bibliography
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
