Improved bounds for discrete Voronoi games

DOI10.1007/978-3-031-38906-1_20OpenAlexW4385357961MaRDI QIDQ6179421

Geert van Wordragen, Mark T. de Berg

Publication date: 16 January 2024

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

Full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_20

zbMATH Keywords

competitive facility locationVoronoi gamesspatial voting theory

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An optimal extension of the centerpoint theorem
• Small weak epsilon-nets
• The one-round Voronoi game
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
• Min-Max payoffs in a two-player location game
• A point in many triangles
• The Voronoi game on graphs and its complexity
• Computing Plurality Points and Condorcet Points in Euclidean Space
• Nash Equilibria in Voronoi Games on Graphs
• Voting Equilibria in Multidimensional Choice Spaces
• Faster Algorithms for Computing Plurality Points
• On one-round discrete voronoi games

This page was built for publication: Improved bounds for discrete Voronoi games