Playing anonymous games using simple strategies
SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 616-631, 2017.
We investigate the complexity of computing approximate Nash equilibria in anonymous games. Our main algorithmic result is the following: For any n-player anonymous game with a bounded number of strategies and any constant δ > 0, an O(1/n1−δ)-approximate Nash equilibrium can be computed in polynomial time. Complementing this positive resul...More
PPT (Upload PPT)