arXiv Analytics

Sign in

arXiv:1811.04518 [math.OC]AbstractReferencesReviewsResources

Constant payoff in zero-sum stochastic games

Miquel Oliu Barton, Bruno Ziliotto

Published 2018-11-12Version 1

In a zero-sum stochastic game, at each stage, two adversary players take decisions and receive a stage payoff determined by them and by a random variable representing the state of nature. The total payoff is the discounted sum of the stage payoffs. Assume that the players are very patient and use optimal strategies. We then prove that, at any point in the game, players get essentially the same expected payoff: the payoff is constant. This solves a conjecture by Sorin, Venel and Vigeral (2010). The proof relies on the semi-algebraic approach for discounted stochastic games introduced by Bewley and Kohlberg (1976), on the theory of Markov chains with rare transitions, initiated by Friedlin and Wentzell (1984), and on some variational inequalities for value functions inspired by the recent work of Davini, Fathi, Iturriaga and Zavidovique (2016)

Related articles: Most relevant | Search more
arXiv:1501.06525 [math.OC] (Published 2015-01-26)
A Tauberian theorem for nonexpansive operators and applications to zero-sum stochastic games
arXiv:1903.10072 [math.OC] (Published 2019-03-24)
On the adjoint Markov policies in stochastic differential games
arXiv:2304.02998 [math.OC] (Published 2023-04-06)
Multiple-Population Discrete-Time Mean Field Games with Discounted and Total Payoffs: The Existence of Equilibria