Publication | Closed Access
On the Complexity of Nash Equilibria in Anonymous Games
31
Citations
29
References
2015
Year
Unknown Venue
EngineeringNon-cooperative Game TheoryEquilibrium AnalysisApproximation Parameter εEquilibrium ProblemGame TheoryNash EquilibriaBusinessε-Approximate Nash EquilibriumComputational ComplexityPure StrategiesComputational Game TheoryGamesImperfect Information GameApproximation TheoryMechanism DesignAlgorithmic Game Theory
We show that the problem of finding an ε-approximate Nash equilibrium in an {anonymous} game with seven pure strategies is complete in PPAD, when the approximation parameter ε is exponentially small in the number of players.
| Year | Citations | |
|---|---|---|
Page 1
Page 1