On the Complexity of Nash Equilibria in Anonymous Games

preprint2014arXivOpen access

Abstract

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.