On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
- 16 September 2019
- book chapter
- Published by Springer Nature
- p. 153-167
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Complexity of Rational and Irrational Nash EquilibriaTheory of Computing Systems, 2013
- On the Complexity of Nash Equilibria and Other Fixed PointsSIAM Journal on Computing, 2010
- The Complexity of Computing a Nash EquilibriumSIAM Journal on Computing, 2009
- New complexity results about Nash equilibriaGames and Economic Behavior, 2008
- Exotic Quantifiers, Complexity Classes, and Complete ProblemsFoundations of Computational Mathematics, 2007
- The Computational Complexity of Some Problems of Linear AlgebraJournal of Computer and System Sciences, 1999
- Nash and correlated equilibria: Some complexity considerationsGames and Economic Behavior, 1989
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Acceptable points in games of perfect informationPacific Journal of Mathematics, 1960
- Non-Cooperative GamesAnnals of Mathematics, 1951