We study stochastic games with incomplete information on one side, where the transition is controlled by one of the players. <p> We prove that if the informed player also controls the transition, the game has a value, whereas if the uninformed player controls the transition, the max-min value, as...</p>

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

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. <p> We propose a...</p>

We obtain results on the sensitivity of the invariant measure and other statistical quantities of a Markov chain with respect to perturbations of the transition matrix. We use graph-theoretic techniques, in contrast with the matrix analysis techniques previously used.

Given a sequence (s0; s1,..., sN) of observations from a finite set S, we construct a process (sn)n_N that satisfies the following properties: (i) (Sn)n_ ·N is a piecewise Markov chain, (ii) the conditional distribution of sn given S0,...,Sn-1 is close to the empirical transition given by the...

We survey recent results on the existence of the value in zero-sum stopping games with discrete and continuous time, and on the existence of e-equilibria in non zero-sum games with discrete time.

We prove that every two-player non zero-sum deterministic stopping game with uniformly bounded payoffs admits an e-equilibrium, for every e0. The proof uses Ramsey Theorem that states that for every coloring of a complete infinite graph by finitely many colors there is a complete infinite...