Better-Reply Dynamics with Bounded Recall

DOI10.1287/moor.1080.0323zbMath1232.91057OpenAlexW2000114536MaRDI QIDQ3169000

Andriy Zapechelnyuk

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/af06267f290ad13f32e94f7e0a73e569f35dcccc

zbMATH Keywords

approachabilityfictitious playregretbounded recallbetter-reply dynamics

Mathematics Subject Classification ID

Discrete-time games (91A50) Multistage and repeated games (91A20) Decision theory for games (91A35)

Related Items (4)

Approachability with bounded memory ⋮ Dynamic benchmark targeting ⋮ Regret matching with finite memory ⋮ Approachability, regret and calibration: implications and equivalences

This page was built for publication: Better-Reply Dynamics with Bounded Recall