Symmetries and the Complexity of Pure Nash Equilibrium

DOI10.1007/978-3-540-70918-3_19zbMath1186.91020OpenAlexW1584215157MaRDI QIDQ3590935

Felix Brandt, Felix Fischer, Markus Holzer

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_19

Mathematics Subject Classification ID

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

Related Items (3)

On skew-symmetric games ⋮ On the Hardness and Existence of Quasi-Strict Equilibria ⋮ A survey on decomposition of finite strategic-form games

This page was built for publication: Symmetries and the Complexity of Pure Nash Equilibrium