Competitive facility location: the Voronoi game

DOI10.1016/j.tcs.2003.09.004zbMath1098.91003OpenAlexW2118282394MaRDI QIDQ1884986

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

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/18870

zbMATH Keywords

Facility locationGame theory

Mathematics Subject Classification ID

2-person games (91A05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Combinatorial games (91A46)

Related Items (33)

The discrete Voronoi game in \(\mathbb{R}^2\) ⋮ Non-cooperative capacitated facility location games ⋮ On the Number of Anchored Rectangle Packings for a Planar Point Set ⋮ On the Performances of Nash Equilibria in Isolation Games ⋮ Nash equilibrium structure of Cox process Hotelling games ⋮ How to play hot and cold ⋮ Optimal strategies for the one-round discrete Voronoi game on a line ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Voronoi games using geodesics ⋮ Multiunit Facility Location Games ⋮ Rectilinear Voronoi games with a simple rectilinear obstacle in plane ⋮ On the performances of Nash equilibria in isolation games ⋮ Approximation of the competitive facility location problem with MIPs ⋮ Voronoi game on graphs ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ MAXIMIZING A VORONOI REGION: THE CONVEX CASE ⋮ A LOCATION GAME ON DISJOINT CIRCLES ⋮ Strategic design of competing supply chain networks with foresight ⋮ Location game on disjoint line segments ⋮ Witness (Delaunay) graphs ⋮ The one-round Voronoi game replayed ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Maximum Neighbour Voronoi Games ⋮ Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution ⋮ The 1-dimensional discrete Voronoi game ⋮ Voronoi game on polygons ⋮ The one-round multi-player discrete Voronoi game on grids and trees ⋮ Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees ⋮ The isolation game: a game of distances ⋮ Facility location problems in the plane based on reverse nearest neighbor queries ⋮ The discrete Voronoi game in a simple polygon ⋮ Conditional Location Problems on Networks and in the Plane ⋮ Location-price competition in airline networks

Cites Work

• Existence theory for spatially competitive network facility location models
• Competitive spatial models
• Facility location on a polyhedral surface
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Market and Locational Equilibrium for Two Competitors
• The one-round Voronoi game
• Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space
• Competitive Location Models: A Framework and Bibliography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Competitive facility location: the Voronoi game