We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rather, they observe a stochastic signal that may depend on the state, and on the pair of actions chosen by the players. We assume each player observes the state and his own action. We propose a candidate for the max-min value, which does not depend on the information structure of player 2. We prove that player 2 can defend the proposed max-min value, and that in absorbing games player 1 can guarantee it. Analogous results hold for the min-max value. This paper thereby unites several results due to Coulomb
We study stochastic games with incomplete information on one side, in which the transition is contro...
We study stochastic games with incomplete information on one side, in which the transition is contro...
Cahier de Recherche du Groupe HEC Paris, n° 754We study stochastic games with incomplete information...
Cahier de Recherche du Groupe HEC Paris, n° 760We study zero-sum stochastic games in which players d...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study finite zero-sum stochastic games in which players do not observe the actions of their oppon...
We study finite zero-sum stochastic games in which players do not observe the actions of their oppon...
We study finite zero-sum stochastic games in which players do not observe the actions of their oppon...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
A two-person zero-sum stochastic game with finitely many states and actions is considered. The class...
We study stochastic games with incomplete information on one side, where the transition is controlle...
We study stochastic games with incomplete information on one side, in which the transition is contro...
We study stochastic games with incomplete information on one side, in which the transition is contro...
We study stochastic games with incomplete information on one side, in which the transition is contro...
Cahier de Recherche du Groupe HEC Paris, n° 754We study stochastic games with incomplete information...
Cahier de Recherche du Groupe HEC Paris, n° 760We study zero-sum stochastic games in which players d...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study finite zero-sum stochastic games in which players do not observe the actions of their oppon...
We study finite zero-sum stochastic games in which players do not observe the actions of their oppon...
We study finite zero-sum stochastic games in which players do not observe the actions of their oppon...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
We study zero-sum stochastic games in which players do not observe the actions of the opponent. Rath...
A two-person zero-sum stochastic game with finitely many states and actions is considered. The class...
We study stochastic games with incomplete information on one side, where the transition is controlle...
We study stochastic games with incomplete information on one side, in which the transition is contro...
We study stochastic games with incomplete information on one side, in which the transition is contro...
We study stochastic games with incomplete information on one side, in which the transition is contro...
Cahier de Recherche du Groupe HEC Paris, n° 754We study stochastic games with incomplete information...