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.

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

We study stopping games in the setup of Neveu. We prove the existence of a uniform value (in a sense defined below), by allowing the players to use randomized strategies. In contrast with previous work, we make no comparison assumption on the payoff processes. Moreover, we prove that the value...

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