Symmetries and the Complexity of Pure Nash Equilibrium

DOI10.1007/978-3-540-70918-3_19zbMATH Open1186.91020OpenAlexW1584215157MaRDI QIDQ3590935FDOQ3590935

Authors: 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

Recommendations

• Symmetries and the complexity of pure Nash equilibrium
• Equilibria of graphical games with symmetries
• Nash equilibria: complexity, symmetries, and approximation
• The complexity of pure Nash equilibria
• scientific article; zbMATH DE number 2243403

Mathematics Subject Classification ID

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

Cited In (12)

• Some results of Maria Serna on strategic games: complexity of equilibria and models
• A note on the symmetry of all Nash equilibria in games with increasing best replies
• Nash equilibria: complexity, symmetries, and approximation
• Symmetries and the complexity of pure Nash equilibrium
• Nash equilibria in symmetric games with partial observation
• The complexity of game isomorphism
• On skew-symmetric games
• A survey on decomposition of finite strategic-form games
• Mathematical Foundations of Computer Science 2005
• On the Hardness and Existence of Quasi-Strict Equilibria
• The complexity of pure Nash equilibria
• Nash equilibria in symmetric graph games with partial observation

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

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