Query complexity of approximate equilibria in anonymous games
We study the computation of Nash equilibria of anonymous games, via algorithms that use adaptive queries to a game’s payoff function. We show that exact equilibria cannot be found via query-efficient algorithms, and exhibit a two-strategy, 3-player anonymous game whose exact equilibria require irrat...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2017
|