The Query Complexity of Correlated Equilibria
Games and Economic Behavior, pp. 401-410, 2018.
We consider the complexity of finding a correlated equilibrium of an n-player game in a model that allows the algorithm to make queries on players' payoffs at pure strategy profiles. Randomized regret-based dynamics are known to yield an approximate correlated equilibrium efficiently, namely, in time that is polynomial in the number of pl...More
PPT (Upload PPT)