The Query Complexity of Correlated Equilibria

Games and Economic Behavior, pp. 401-410, 2018.

Cited by: 25|Bibtex|Views9|DOI:https://doi.org/10.1016/j.geb.2016.11.003
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org|www.sciencedirect.com
Keywords:

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments