Approachability of convex sets in generalized quitting games

09/28/2016
by   János Flesch, et al.
0

We consider Blackwell approachability, a very powerful and geometric tool in game theory, used for example to design strategies of the uninformed player in repeated games with incomplete information. We extend this theory to "generalized quitting games" , a class of repeated stochastic games in which each player may have quitting actions, such as the Big-Match. 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. In the special case where only the approaching player can quit the game (Big-Match of type I), the three conditions are equivalent and coincide with Blackwell's condition. Consequently, we obtain a full characterization and prove that the game is weakly determined-every convex set is either weakly approachable or weakly excludable. In games where only the opponent can quit (Big-Match of type II), none of our conditions is both sufficient and necessary for weak approachability. We provide a continuous time sufficient condition using techniques coming from differential games, and show its usefulness in practice, in the spirit of Vieille's seminal work for weak approachability.Finally, we study uniform approachability where the strategy should not depend on the horizon and demonstrate that, in contrast with classical Blackwell approacha-bility for convex sets, weak approachability does not imply uniform approachability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2019

Zero-Determinant strategies in finitely repeated n-player games

In two-player repeated games, Zero-Determinant (ZD) strategies are a cla...
research
03/09/2023

Blackwell's Approachability with Time-Dependent Outcome Functions and Dot Products. Application to the Big Match

Blackwell's approachability is a very general sequential decision framew...
research
11/12/2018

A differential game on Wasserstein space. Application to weak approachability with partial monitoring

Studying continuous time counterpart of some discrete time dynamics is n...
research
07/11/2019

Time-aware uniformization of winning strategies

Two-player win/lose games of infinite duration are involved in several d...
research
04/25/2019

Smart Jammer and LTE Network Strategies in An Infinite-Horizon Zero-Sum Repeated Game with Asymmetric and Incomplete Information

LTE/LTE-Advanced networks are known to be vulnerable to denial-of-servic...
research
05/23/2013

A Primal Condition for Approachability with Partial Monitoring

In approachability with full monitoring there are two types of condition...
research
09/12/2020

Hot Racquet or Not? An Exploration of Momentum in Grand Slam Tennis Matches

The presence of momentum in sports, where the outcome of a previous even...

Please sign up or login with your details

Forgot password? Click here to reset