Approachability of convex sets in generalized quitting games
Flesh, Janos; Laraki, Rida; Perchet, Vianney (2018), Approachability of convex sets in generalized quitting games, Games and Economic Behavior, 108, p. 411-431. 10.1016/j.geb.2017.12.007
TypeArticle accepté pour publication ou publié
Journal nameGames and Economic Behavior
MetadataShow full item record
Department of Quantitative Economics [Maastricht]
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Centre de Mathématiques et de Leurs Applications [CMLA]
Abstract (EN)We examine Blackwell approachability in so-called generalized quitting games. These are repeated games in which each player may have quitting actions that terminate the game. We provide three simple geometric and strongly related conditions for the weak approachability of a convex target set. The first is sufficient: it guarantees that, for any fixed horizon, a player has a strategy ensuring that the expected time-average payoff vector converges to the target set as horizon goes to infinity. The third is necessary: if it is not satisfied, the opponent can weakly exclude the target set. We analyze in detail the special cases where only one of the players has quitting actions. Finally, we study uniform approachability where the strategy should not depend on the horizon and demonstrate that, in contrast with classical Blackwell approachability for convex sets, weak approachability does not imply uniform approachability.
Subjects / KeywordsBlackwell approachability; Stochastic games; Absorbing games; Determinacy
Showing items related by title and author.