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

preprint2015arXivOpen access

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 nn-stage values {vn,n≥1}\{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: (vn)(v_n) converges uniformly if and only if (vλ)(v_λ) 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→∞vn=lim⁡λ→0vλMaxmin=\lim_{n\to\infty} v_n=\lim_{λ\to 0}v_λ. Finally, we deduce the existence of the uniform value in finite recursive game with symmetric information.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.