Best response digraphs for two location games on graphs

zbMATH Open1229.91086MaRDI QIDQ3099758FDOQ3099758

Authors: Erich Prisner 

Publication date: 1 December 2011

Recommendations

• Nash Equilibria in Voronoi Games on Graphs
• Pure-strategy Nash equilibria on competitive diffusion games
• Voronoi Games on Cycle Graphs
• The one-round multi-player discrete Voronoi game on grids and trees
• The one-round multi-player discrete Voronoi game on grids and trees

zbMATH Keywords

graphspure Nash equilibriasimultaneous gamesbest response digraph

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Cited In (4)

• The Hotelling bi-matrix game
• Voronoi Games on Cycle Graphs
• Best-response potential for Hotelling pure location games
• Nash Equilibria in Voronoi Games on Graphs

This page was built for publication: Best response digraphs for two location games on graphs

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