Bounds for the query complexity of approximate equilibria
We analyze the number of payoff queries needed to compute approximate equilibria of multi-player games. We find that query complexity is an effective tool for distinguishing the computational difficulty of alternative solution concepts, and we develop new techniques for upper- and lower bounding the...
| Autors principals: | , |
|---|---|
| Format: | Journal article |
| Idioma: | English |
| Publicat: |
Association for Computing Machinery
2016
|