Nash Equilibria in Voronoi Games on Graphs

DOI10.1007/978-3-540-75520-3_4zbMath1151.90477arXivcs/0702054OpenAlexW2164336470MaRDI QIDQ3527197

Nguyen Kim Thang, Christoph Dürr

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0702054

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (30)

The discrete Voronoi game in \(\mathbb{R}^2\) ⋮ Complexity of equilibrium in competitive diffusion games on social networks ⋮ Competitive Diffusion on Weighted Graphs ⋮ Pure Nash equilibria of competitive diffusion process on toroidal grid graphs ⋮ On the Performances of Nash Equilibria in Isolation Games ⋮ Nash equilibrium structure of Cox process Hotelling games ⋮ \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games ⋮ Multi-player Diffusion Games on Graph Classes ⋮ Existence of pure Nash equilibria in 2-player information diffusion games with strict public preferences ⋮ Multiunit Facility Location Games ⋮ Rectilinear Voronoi games with a simple rectilinear obstacle in plane ⋮ Improved bounds for discrete Voronoi games ⋮ Information diffusion on the iterated local transitivity model of online social networks ⋮ On the performances of Nash equilibria in isolation games ⋮ Voronoi game on graphs ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Network movement games ⋮ Pure-strategy Nash equilibria on competitive diffusion games ⋮ Location game on disjoint line segments ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games ⋮ Finding all pure strategy Nash equilibria in a planar location game ⋮ A note on competitive diffusion through social networks ⋮ The one-round multi-player discrete Voronoi game on grids and trees ⋮ Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm ⋮ Location Games on Networks: Existence and Efficiency of Equilibria ⋮ Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees ⋮ The isolation game: a game of distances ⋮ Multi-Player Diffusion Games on Graph Classes ⋮ On the sequential price of anarchy of isolation games

This page was built for publication: Nash Equilibria in Voronoi Games on Graphs