ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
- 20 June 2015
- book chapter
- Published by Springer Nature
- p. 554-566
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Query complexity of approximate nash equilibria2014
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions2014
- Polynomial-time computation of exact correlated equilibrium in compact games2011
- On the Complexity of Nash Equilibria and Other Fixed PointsSIAM Journal on Computing, 2010
- Settling the complexity of computing two-player Nash equilibriaJournal of the ACM, 2009
- The Complexity of Computing a Nash EquilibriumSIAM Journal on Computing, 2009
- New complexity results about Nash equilibriaGames and Economic Behavior, 2008
- Settling the Complexity of Two-Player Nash Equilibrium2006
- Nash and correlated equilibria: Some complexity considerationsGames and Economic Behavior, 1989
- Some algebraic and geometric computations in PSPACE1988