The 1-dimensional discrete Voronoi game
From MaRDI portal
Publication:2294280
DOI10.1016/j.orl.2019.01.003zbMath1476.91104OpenAlexW2914096283MaRDI QIDQ2294280
Aritra Banik, Sandip Das, Bhaswar B. Bhattacharya, Sreeja Das
Publication date: 10 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2019.01.003
Applications of game theory (91A80) Discrete location and assignment (90B80) Spatial models in economics (91B72)
Related Items (2)
Voronoi games using geodesics ⋮ Rectilinear Voronoi games with a simple rectilinear obstacle in plane
Cites Work
- Optimal strategies for the one-round discrete Voronoi game on a line
- Voronoi game on graphs
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions
- The one-round Voronoi game replayed
- Facility location problems in the plane based on reverse nearest neighbor queries
- Competitive spatial models
- The one-round Voronoi game
- The discrete Voronoi game in \(\mathbb{R}^2\)
- Competitive facility location: the Voronoi game
- New variations of the maximum coverage facility location problem
- Finding a guard that sees most and a shop that sells most
- The Principle of Minimum Differentiation Reconsidered: Some New Developments in the Theory of Spatial Competition
- Competitive Location Models: A Framework and Bibliography
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
This page was built for publication: The 1-dimensional discrete Voronoi game
