We consider an example of a Markov game with lack of information on one side, that was first introduced by Renault (2002). We compute both the value and optimal strategies for a range of parameter values.

Quitting games are sequential games in which, at any stage, each player has the choice between continuing and quitting. The game ends as soon as at least player chooses to quit; player i then receives a payoff r, which depends on the set S of players that did choose to quit. If the game never...

We study the existence of correlated equilibrium payoff in stochastic games. The correlation devices that we use are either autonomous (they base their choice of signal on previous signals, but not on previous states or actions) or stationary (their choice is independent of any data, and is...

We prove the existence of Blackwell epsilon-optimal strategies in finite Markov Decision Processes with partial observation.

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...