Papers
Topics
Authors
Recent
Search
2000 character limit reached

Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture "$Maxmin=\lim v_n=\lim v_λ$"

Published 2 Jun 2015 in math.OC and math.PR | (1506.00949v1)

Abstract: We study two-player zero-sum recursive games with a countable state space and finite action spaces at each state. When the family of $n$-stage values ${v_n,n\geq 1}$ is totally bounded for the uniform norm, we prove the existence of the uniform value. Together with a result in Rosenberg and Vieille (2000), we obtain a uniform Tauberian theorem for recursive games: $(v_n)$ converges uniformly if and only if $(v_\lambda)$ converges uniformly. We apply our main result to finite recursive games with signals (where players observe only signals on the state and on past actions). When the maximizer is more informed than the minimizer, we prove the Mertens conjecture $Maxmin=\lim_{n\to\infty} v_n=\lim_{\lambda\to 0}v_\lambda$. Finally, we deduce the existence of the uniform value in finite recursive game with symmetric information.

Citations (11)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.