On the Complexity of Nash Equilibria in Anonymous Games
classification
💻 cs.GT
keywords
anonymousepsilonnashapproximateapproximationcompletecomplexityequilibria
read the original abstract
We show that the problem of finding an {\epsilon}-approximate Nash equilibrium in an anonymous game with seven pure strategies is complete in PPAD, when the approximation parameter {\epsilon} is exponentially small in the number of players.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.