We consider a dynamic version of sender-receiver games, where the sequence of states follows an irreducible Markov chain observed by the sender. Under mild assumptions, we provide a simple characterization of the limit set of equilibrium payoffs, as players become very patient. Under these...

In this paper, the authors characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs...

In this paper, the authors introduce a form of pre-play communication that we call "preopening". During the preopening, players announce their tentative actions to be played in the underlying game. Announcements are made using a posting system which is subject to stochastic failures. Posted...

In this note we study a take-it-or-leave-it bargaining procedure between two risk neutral individuals engaged in the joint stochastic production of a commodity. Each individual has to exert effort, that is, to provide a one-dimensional input which is unobserved to the other individual. The...

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

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>

A multi-player Dynkin game is a sequential game in which at every stage one of the players is chosen, and that player can decide whether to continue the game or to stop it, in which case all players receive some terminal payoff. <p> We study a variant of this model, where the order by which players...</p>

We address the question of existence of equilibrium in general timing games of complete information. Under weak assumptions, any two-player timing game has a subgame perfect e-equilibrium, for each e 0. This result is tight. For some classes of games (symmetric games, games with cumulative...