On the impossibility of achieving no regrets in repeated games
Regret-minimizing strategies for repeated games have been receiving increasing attention in the literature. These are simple adaptive behavior rules that lead to no regrets and, if followed by all players, exhibit nice convergence properties: the average play converges to correlated equilibrium, or even to Nash equilibrium in certain classes of games. However, the no-regret property relies on a strong assumption that each player treats her opponents as unresponsive and fully ignores the opponents’ possible reactions to her actions. We show that if at least one player is slightly responsive, it is impossible to achieve no regrets, and convergence results for regret minimization with responsive opponents are unknown.
Volume (Year): 81 (2012)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/jebo|
References listed on IDEAS
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.:
- Fudenberg, Drew & Levine, David K., 1995.
"Consistency and cautious fictitious play,"
Journal of Economic Dynamics and Control,
Elsevier, vol. 19(5-7), pages 1065-1089.
- 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, 2000. "A Simple Adaptive Procedure Leading to Correlated Equilibrium," Econometrica, 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, 1996. "A simple adaptive procedure leading to correlated equilibrium," Economics Working Papers 200, Department of Economics and Business, Universitat Pompeu Fabra, revised Dec 1996.
- Ehud Lehrer & Dinah Rosenberg, 2003.
"A Wide Range No-Regret Theorem,"
Game Theory and Information
- Sergiu Hart, 2004.
122247000000000471, UCLA Department of Economics.
- Sergiu Hart, 2005. "Adaptive Heuristics," Econometrica, Econometric Society, vol. 73(5), pages 1401-1430, 09.
- Sergiu Hart, 2013. "Adaptive Heuristics," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 11, pages 253-287 World Scientific Publishing Co. Pte. Ltd..
- Lehrer, Ehud & Solan, Eilon, 2009. "Approachability with bounded memory," Games and Economic Behavior, Elsevier, vol. 66(2), pages 995-1004, July.
- Freund, Yoav & Schapire, Robert E., 1999. "Adaptive Game Playing Using Multiplicative Weights," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 79-103, October.
- Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
- Young, H. Peyton, 2004. "Strategic Learning and its Limits," OUP Catalogue, Oxford University Press, number 9780199269181, December.
When requesting a correction, please mention this item's handle: RePEc:eee:jeborg:v:81:y:2012:i:1:p:153-158. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.