Optimal strategies for the one-round discrete Voronoi game on a line

DOI10.1007/978-3-642-22685-4_19zbMATH Open1302.91005OpenAlexW181389785MaRDI QIDQ3087952FDOQ3087952

Authors: Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das 

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_19

Recommendations

• Optimal strategies for the one-round discrete Voronoi game on a line
• Competitive facility location: the Voronoi game
• Two-round discrete Voronoi game along a line
• The 1-dimensional discrete Voronoi game
• The discrete Voronoi game in \(\mathbb{R}^2\)

Mathematics Subject Classification ID

Applications of game theory (91A80) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) 2-person games (91A05) Discrete location and assignment (90B80) Combinatorial games (91A46) Spatial models in economics (91B72)

Cited In (8)

• The discrete Voronoi game in \(\mathbb{R}^2\)
• The one-round Voronoi game
• Two-round discrete Voronoi game along a line
• The discrete Voronoi game in a simple polygon
• The 1-dimensional discrete Voronoi game
• Optimal strategies in single round Voronoi game on convex polygons with constraints
• Optimal strategies for the one-round discrete Voronoi game on a line
• Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions

This page was built for publication: Optimal strategies for the one-round discrete Voronoi game on a line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087952)