The Query Complexity of Correlated Equilibria
AbstractWe consider the complexity of finding a Correlated Equilibrium in an n-player game in a model that allows the algorithm to make queries for players' utilities at pure strategy profiles. Many randomized regret-matching dynamics are known to yield an approximate correlated equilibrium quickly: in time that is polynomial in the number of players, n, the number of strategies of each player, m, and the approximation error, 1/?. Here we show that both randomization and approximation are necessary: no efficient deterministic algorithm can reach even an approximate equilibrium and no efficient randomized algorithm can reach an exact equilibrium.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by David K. Levine in its series Levine's Working Paper Archive with number 786969000000000819.
Date of creation: 22 Sep 2013
Date of revision:
Contact details of provider:
Web page: http://www.dklevine.com/
Other versions of this item:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Sergiu Hart & Andreu Mas-Colell, 2000.
"A Simple Adaptive Procedure Leading to Correlated Equilibrium,"
Econometric Society, vol. 68(5), pages 1127-1150, September.
- S. Hart & A. Mas-Collel, 2010. "A Simple Adaptive Procedure Leading to Correlated Equilibrium," Levine's Working Paper Archive 572, David K. Levine.
- Sergiu Hart & Andreu Mas-Colell, 1997. "A Simple Adaptive Procedure Leading to Correlated Equilibrium," Game Theory and Information 9703006, EconWPA, revised 24 Mar 1997.
- Sergiu Hart & Andreu Mas-Colell, 1996. "A simple adaptive procedure leading to correlated equilibrium," Economics Working Papers 200, Department of Economics and Business, Universitat Pompeu Fabra, revised Dec 1996.
- Hart, Sergiu & Mansour, Yishay, 2010. "How long to equilibrium? The communication complexity of uncoupled equilibrium procedures," Games and Economic Behavior, Elsevier, vol. 69(1), pages 107-126, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David K. Levine).
If references are entirely missing, you can add them using this form.