scientific article; zbMATH DE number 1798165

MaRDI QIDQ4553235zbMATH OpenFDO

Authors Hee-Kap Ahn, Siu-Wing Cheng, René van Oostrum, Otfried Cheong, Mordecai J. Golin

Publication date 4 November 2002

zbMATH Keywords

competitive facility location problemtwo playersVoronoi game

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Applications of game theory (91A80)

Recommendations

• Competitive facility location: the Voronoi game
• Optimal strategies for the one-round discrete Voronoi game on a line
• Voronoi game on graphs
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
• The discrete Voronoi game in \(\mathbb{R}^2\)

Cited in

(10)

• Competitive facility location: the Voronoi game
• Traveling salesmen in the presence of competition
• Electoral strategies in a dynamical democratic system. Geometric models
• Min-Max payoffs in a two-player location game
• A location game on disjoint circles
• Maximum Neighbour Voronoi Games
• Location game on disjoint line segments
• Improved bounds for discrete Voronoi games
• Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
• Discrete Voronoi games and -nets, in two and three dimensions

This page was built for publication:

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