The Voronoi game on graphs and its complexity
From MaRDI portal
Publication:2865040
Recommendations
Cited in
(26)- Maximum Neighbour Voronoi Games
- The one-round Voronoi game replayed
- Voronoi game on polygons
- The computational complexity of forced capture Hnefatafl
- The discrete Voronoi game in \(\mathbb{R}^2\)
- Finding safe strategies for competitive diffusion on trees
- The one-round Voronoi game
- Feedback game on Eulerian graphs
- Nash equilibrium structure of Cox process Hotelling games
- The one-round multi-player discrete Voronoi game on grids and trees
- 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
- Rectilinear Voronoi games with a simple rectilinear obstacle in plane
- Improved bounds for discrete Voronoi games
- Advantage in the discrete Voronoi game
- Nash equilibria in reverse temporal Voronoi games
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
- Competitive diffusion on weighted graphs
- Voronoi game on graphs
- The discrete Voronoi game in a simple polygon
- Voronoi game on graphs
- Competitive facility location: the Voronoi game
- Pure-strategy Nash equilibria on competitive diffusion games
- Optimal strategies in single round Voronoi game on convex polygons with constraints
- The one-round Voronoi game replayed.
This page was built for publication: The Voronoi game on graphs and its complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865040)