Best response digraphs for two location games on graphs

MaRDI QIDQ3099758zbMATH OpenFDO

Authors Erich Prisner

Publication date 1 December 2011

zbMATH Keywords

best response digraphgraphspure Nash equilibriasimultaneous games

Mathematics Subject Classification ID

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

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

Cited in

(4)

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

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)