Uniform Value in Recursive Games
نویسندگان
چکیده
We address the problem of existence of the uniform value in recursive games. We give two existence results: (i) the uniform value is shown to exist if the state space is countable, the action sets are finite and if, for some a > 0, there are finitely many states in which the limsup value is less than a; (ii) for games with nonnegative payoff function, it is sufficient that the action set of player 2 is finite. The finiteness assumption can be further weakened.
منابع مشابه
On values of repeated games with signals
We study the existence of different notions of value in two-person zero-sum repeated games where the state evolves and players receive signals. We provide some examples showing that the limsup value (and the uniform value) may not exist in general. Then we show the existence of the value for any Borel payoff function if the players observe a public signal including the actions played. We also p...
متن کاملOn the values of repeated games with signals
We study the existence of different notions of values in two-person zero-sum repeated games where the state evolves and players receive signals. We provide some examples showing that the limsup value and the uniform value may not exist in general. Then, we show the existence of the value for any Borel payoff function if the players observe a public signal including the actions played. We prove ...
متن کاملZero-Sum Repeated Games: Recent Advances and New Links with Differential Games
The purpose of this survey is to describe some recent advances in zero-sum repeated games and in particular new connections to differential games. Topics include: approachability, asymptotic analysis: recursive formula and operator approach, dual game and incomplete information, uniform approach.
متن کاملThe Shapley value for games on matroids: The dynamic model
According to the work of Faigle [3] a static Shapley value for games on matroids has been introduced in Bilbao, Driessen, JiménezLosada and Lebrón [1]. In this paper we present a dynamic Shapley value by using a dynamic model which is based on a recursive sequence of static models. In this new model for games on matroids, our main result is that there exists a unique value satisfying analogous ...
متن کاملRecursive Stochastic Games with Positive Rewards
We study the complexity of a class of Markov decision processes and, more generally, stochastic games, called 1-exit Recursive Markov Decision Processes (1-RMDPs) and Simple Stochastic Games (1-RSSGs) with strictly positive rewards. These are a class of finitely presented countable-state zero-sum stochastic games, with total expected reward objective. They subsume standard finite-state MDPs and...
متن کامل