Logarithmic query complexity for approximate Nash computation in large games
We investigate the problem of equilibrium computation for “large” n-player games where each player has two pure strategies. Large games have a Lipschitz-type property that no single player’s utility is greatly affected by any other individual player’s actions. In this paper, we assume that a player...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer, Berlin, Heidelberg
2016
|