EconPapers    
Economics at your fingertips  
 

Limit Behavior of No-regret Dynamics

Andriy Zapechelnyuk

No 21, Discussion Papers from Kyiv School of Economics

Abstract: Consider a repeated game where all players follow no-regret strategies by reinforcing the actions that they regret not having played enough in the past. We show that a resulting no-regret dynamic approaches in the long run a best-response dynamic and leads to its invariant sets: rest points (Nash equilibria) or periodic orbits. The convergence results for best-response dynamics known in the literature immediately apply to no-regret dynamics. Thus, every no-regret dynamic leads to Nash equilibrium in zero-sum games, weighted potential and two-player ordinal potential games, supermodular games with diminishing returns, and some other special classes.

Keywords: Regret minimization; no-regret strategy; best-response dynamic; Nash equilibrium; Shapley polygon; curb set (search for similar items in EconPapers)
JEL-codes: C44 D81 D83 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-evo and nep-gth
Date: 2009-10
Note: Under review in Journal of Economic Theory
References: View references in EconPapers View complete reference list from CitEc
Citations Track citations by RSS feed

Downloads: (external link)
http://repec.kse.org.ua/pdf/KSE_dp21.pdf First version, October 2009 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kse:dpaper:21

Access Statistics for this paper

More papers in Discussion Papers from Kyiv School of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Iryna Sobetska ().

 
Page updated 2018-08-04
Handle: RePEc:kse:dpaper:21