Zero-sum repeated games: Counterexamples to the existence of the asymptotic value and the conjecture $\operatorname{maxmin}=\operatorname{lim}v_n$
Abstract
Mertens [In Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two general conjectures about repeated games: the first one is that, in any two-person zero-sum repeated game, the asymptotic value exists, and the second one is that, when Player 1 is more informed than Player 2, in the long run Player 1 is able to guarantee the asymptotic value. We disprove these two long-standing conjectures by providing an example of a zero-sum repeated game with public signals and perfect observation of the actions, where the value of the $\lambda$-discounted game does not converge when $\lambda$ goes to 0. The aforementioned example involves seven states, two actions and two signals for each player. Remarkably, players observe the payoffs, and play in turn.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2013
- DOI:
- 10.48550/arXiv.1305.4778
- arXiv:
- arXiv:1305.4778
- Bibcode:
- 2013arXiv1305.4778Z
- Keywords:
-
- Mathematics - Optimization and Control;
- Computer Science - Machine Learning;
- 91A20 (Primary);
- 91A05;
- 91A15 (Secondary)
- E-Print:
- Published at http://dx.doi.org/10.1214/14-AOP997 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)