On the impossibility of achieving no regrets in repeated games

• Published in: Journal of economic behavior & organization 2012, Vol.81 (1), p.153-158
• Main Authors: Schlag, Karl, Zapechelnyuk, Andriy
• Format: Article
• Language: English
• Subjects: Adaptive strategies; C73; D81; D83; Game theory; Games of strategy; Nash equilibrium; Playing activities; Regret matching; Regret minimization
• ISSN: 0167-2681; 1879-1751
• DOI: 10.1016/j.jebo.2011.09.014

► 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 no-regret property relies on a strong assumption that each player fully ignores the opponents’ possible reactions to her actions. ► We show that if at least one player is slightly responsive, it may be impossible to achieve no regrets. ► Convergence results for regret minimization with responsive opponents are unknown. 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.