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

We prove an existence result for games with incomplete information with continuous type spaces under the assumption that players have atomic posteriors. This information structure is an extreme example of the failure of absolute continuity of information, hence our result complements the...

An absorbing game is a repeated game where some of the action combinations are absorbing, in the sense that whenever they are played, there is a positive probability that the game terminates, and the players receive some terminal payoff at every future stage. We prove that every n-player...

Randomization may add beneficial flexibility to the construction of optimal simple decision rules in dynamic environments. A decision maker, restricted to the use of simple rules, may find a stochastic rule that strictly outperforms all deterministic ones. This is true even in highly separable...

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