Voronoi Games on Cycle Graphs
From MaRDI portal
Recommendations
Cited in
(29)- Games without repetitions on graphs with vertex disjoint cycles
- Approximation of the competitive facility location problem with MIPs
- Pure-strategy Nash equilibria on competitive diffusion games
- Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm
- On the sequential price of anarchy of isolation games
- Robust equilibria in location games
- Highway games on weakly cyclic graphs
- Multi-player diffusion games on graph classes
- Best response digraphs for two location games on graphs
- Pure Nash equilibria of competitive diffusion process on toroidal grid graphs
- Competitive diffusion on weighted graphs
- Nash Equilibria in Voronoi Games on Graphs
- Maximum Neighbour Voronoi Games
- Voronoi choice games
- A search game on a cyclic graph
- Voronoi game on graphs
- Technical note: The competitive facility location problem in a duopoly: advances beyond trees
- Multiunit facility location games
- Location Games on Networks: Existence and Efficiency of Equilibria
- On the Performances of Nash Equilibria in Isolation Games
- Multi-Player Diffusion Games on Graph Classes
- The buck-passing game
- The one-round multi-player discrete Voronoi game on grids and trees
- The one-round multi-player discrete Voronoi game on grids and trees
- Primarily about primaries
- On the performances of Nash equilibria in isolation games
- Equilibrium analysis of customer attraction games
- Nash equilibria in reverse temporal Voronoi games
- A note on competitive diffusion through social networks
This page was built for publication: Voronoi Games on Cycle Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599153)