The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria

DOI10.1016/J.IPL.2006.03.010zbMath1185.91027OpenAlexW2124492011MaRDI QIDQ845734

Markus Holzer, Felix Fischer, Stefan Katzenbeisser

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.03.010

zbMATH Keywords

computational complexitygame theorypure strategy Nash equilibrium

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Weighted Boolean Formula Games ⋮ Equilibria of graphical games with symmetries ⋮ Equilibria problems on games: complexity versus succinctness ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Pairwise-Interaction Games ⋮ Symmetries and the complexity of pure Nash equilibrium

Cites Work

• Non-cooperative games
• Unnamed Item
• Unnamed Item

This page was built for publication: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria