arXiv Analytics

Sign in

arXiv:2106.09405 [math.OC]AbstractReferencesReviewsResources

Mertens conjectures in absorbing games with incomplete information

Bruno Ziliotto

Published 2021-06-17Version 1

In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by both players. Actions and states are imperfectly observed by players, who receive a private signal at each stage. Mertens (ICM 1986) conjectured two properties regarding games with long duration: first, that limit value always exists, second, that when Player 1 is more informed than Player 2, she can guarantee uniformly the limit value. These conjectures were disproved recently by the author, but remain widely open in many subclasses. A well-known particular subclass is the one of absorbing games with incomplete information on both sides, in which the state can move at most once during the game, and players get a private signal about it at the outset of the game. This paper proves Mertens conjectures in this particular model, by introducing a new approximation technique of belief dynamics, that is likely to generalize to many other frameworks. In particular, this makes a significant step towards the understanding of the following broad question: in which games do Mertens conjectures hold?

Related articles: Most relevant | Search more
arXiv:2003.02663 [math.OC] (Published 2020-03-04)
Constant payoff in absorbing games
arXiv:1811.04518 [math.OC] (Published 2018-11-12)
Constant payoff in zero-sum stochastic games
arXiv:1501.06525 [math.OC] (Published 2015-01-26)
A Tauberian theorem for nonexpansive operators and applications to zero-sum stochastic games