Weak Approachability of Convex Sets in Absorbing Games

References

• [1] Aumann R, Maschler M (1995) Repeated Games with Incomplete Information (MIT Press, Cambridge, MA).Google Scholar
• [2] Bewley T, Kohlberg E (1976) The asymptotic theory of stochastic games. Math. Oper. Res. 1(3):197–208.Link, Google Scholar
• [3] Blackwell D (1956) An analog of the minimax theorem for vector payoffs. Pacific J. Math. 6(1):1–8.Crossref, Google Scholar
• [4] Blackwell D, Ferguson T (1968) The big match. Ann. Math. Statist. 39(1):159–163.Crossref, Google Scholar
• [5] Cardaliaguet P, Laraki R, Sorin S (2012) A continuous time approach for the asymptotic value in two-person zero-sum repeated games. SIAM J. Control Optim. 50(3):1573–1596.Crossref, Google Scholar
• [6] Dawid A (1985) Self-calibrating priors do not exist. J. Amer. Statist. Assoc. 80(390):340–341.Google Scholar
• [7] Flesch J, Laraki R, Perchet V (2018) Approachability of convex sets in generalized quitting games. Games Econom. Behav. 108:411–431.Crossref, Google Scholar
• [8] Foster D (1999) A proof of calibration via Blackwell’s approachability theorem. Games Econom. Behav. 29(1–2):73–78.Crossref, Google Scholar
• [9] Foster D, Vohra R (1997) Calibrated learning and correlated equilibrium. Games Econom. Behav. 21(1–2):40–55.Crossref, Google Scholar
• [10] Fournier G, Kuperwasser E, Munk O, Solan E, Weinbaum A (2021) Approachability with constraints. Eur. J. Oper. Res. 292(2):687–695.Crossref, Google Scholar
• [11] Gillette D (1957) Stochastic games with zero-stop probabilities (Princeton University Press, Princeton, NJ), 179–187.Google Scholar
• [12] Hansen K, Ibsen-Jensen R, Neyman A (2018) The big match with a clock and a bit of memory. Discussion Paper Series dp716, The Federmann Center for the Study of Rationality, The Hebrew University, Jerusalem.Google Scholar
• [13] Kohlberg E (1974) Repeated games with absorbing states. Ann. Statist. 2(4):724–738.Crossref, Google Scholar
• [14] Kwon J, Ziliotto B (2023) Blackwell’s approachability with time-dependent outcome functions and dot products: Application to the big match. Preprint, submitted March 9, https://doi.org/10.48550/arXiv.2303.04956.Google Scholar
• [15] Laraki R (2010) Explicit formulas for repeated games with absorbing states. Internat. J. Game Theory. 39:53–70.Crossref, Google Scholar
• [16] Lehrer E, Solan E (2009) Approachability with bounded memory. Games Econom. Behav. 66(2):995–1004.Crossref, Google Scholar
• [17] Lehrer E, Solan E (2016) General internal regret-free strategy. Dynamic Games Appl. 6(1):112–138.Crossref, Google Scholar
• [18] Mannor S, Perchet V, Stoltz G (2014) Set-valued approachability and online learning with partial monitoring. J. Machine Learn. Res. 15(94):3247–3295.Google Scholar
• [19] Milman E (2006) Approachable sets of vector payoffs in stochastic games. Games Econom. Behav. 56(1):135–147.Crossref, Google Scholar
• [20] Perchet V (2014) Approachability, regret and calibration. Implications and equivalences. J. Dynamics Games 1(2):181–254.Crossref, Google Scholar
• [21] Perchet V (2015) Exponential weight approachability, applications to calibration and regret minimization. Dynamic Games Appl. 5:136–153.Crossref, Google Scholar
• [22] Rosenberg D (2000) Zero sum absorbing games with incomplete information on one side: Asymptotic analysis. SIAM J. Control Optim. 39(1):208–225.Crossref, Google Scholar
• [23] Shani B, Solan E (2014) Strong approachability. J. Dynamic Games 1(3):507–535.Crossref, Google Scholar
• [24] Shapley L (1953) Stochastic games. Proc. Natl. Acad. Sci. USA 39(10):1095–1100.Crossref, Google Scholar
• [25] Sorin S (1982) A note on a theorem of Blackwell. Technical report, Laboratoire d’Econométrie de l’Ecole Polytechnique.Google Scholar
• [26] Sorin S (1984) Big match with lack of information on one side (part i). Internat. J. Game Theory 13(3):201–255.Crossref, Google Scholar
• [27] Sorin S (1985) Big match with lack of information on one side (part ii). Internat. J. Game Theory 14(3):173–204.Crossref, Google Scholar
• [28] Sorin S (2002) A First Course on Zero Sum Repeated Games (Springer, Berlin).Google Scholar
• [29] Vieille N (1992) Weak approachability. Math. Oper. Res. 17(4):781–791.Link, Google Scholar
• [30] Ziliotto B (2021) Mertens conjectures in absorbing games with incomplete information. Preprint, submitted June 17, https://arxiv.org/abs/2106.09405.Google Scholar