Optimal Strategies for the One-Round Discrete Voronoi Game on a Line

DOI10.1007/978-3-642-22685-4_19zbMath1302.91005OpenAlexW181389785MaRDI QIDQ3087952

Aritra Banik, Sandip Das, Bhaswar B. Bhattacharya

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

Mathematics Subject Classification ID

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

Related Items (2)

Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions ⋮ The discrete Voronoi game in a simple polygon

This page was built for publication: Optimal Strategies for the One-Round Discrete Voronoi Game on a Line