We study the existence of uniform equilibria for three-player repeated games with lack of information on one side and perfect observation. If there are only two states of nature, a completely revealing or a joint plan equilibrium always exists. This is not the case for larger spaces of states.

The motivation of this paper comes from repeated games with incomplete information and imperfect monitoring. It concerns the existence, for any payoff function, of a particular equilibrium (called completely revealing) allowing each player to learn the state of nature. We consider thus an...

We consider two-person undiscounted repeated games with lack of information on one side and state-independent signalling and prove the existence of a "joint plan" uniform equilibrium.

We give new proofs of existence of the limit of the discounted values for two person zero-sum games in the following frameworks: incomplete information, absorbing, recursive. The idea of these new proofs is to use some comparison criteria.

We consider the general model of zero-sum repeated games (or stochastic games with signals), and assume that one of the players is fully informed and controls the transitions of the state variable. We prove the existence of the uniform value, generalizing several results of the literature. A...

We consider the asymptotic value of two person zero sum repeated games with general evaluations of the stream of stage payoffs. We show existence for incomplete information games, splitting games and absorbing games. The technique of proof consists in embedding the discrete repeated game into a...

We survey selected results on strategic information transmission. We distinguish between "cheap talk" and "persuasion". In the latter model, the informed player's message set depends on his type. As a benchmark, we first assume that the informed player sends a single message to the decision...

We prove the existence of the maxmin of zero-sum recursive games with one sided information.