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

Voters determine their preferences over alternatives based on cases (or arguments) that are raised in the public debate. Each voter is characterized by a matrix, measuring how much support each case lends to each alternative, and her ranking is additive in cases. We show that the majority vote...

Voters' preferences depend on the available information. Following Case-Based Decision Theory, we assume that this information is processed additively. We prove that the collective preferences deduced from the individual ones through majority vote cannot be arbitrary, as soon as a winning quota...

The general idea of the proof is to define a class of sets, the solvable sets, which can safely be thought of as absorbing states.

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

Presentation of somme recent results of stochastic games

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.