We study the existence of correlated equilibrium payoff in stochastic games. The correlation devices that we use are either autonomous (they base their choice of signal on previous signals, but not on previous states or actions) or stationary (their choice is independent of any data, and is...

This paper studies extensive form games with public information where all players have the same information at each point in time. We prove that when there are at least three players, all communication equilibrium payoffs can be obtained by unmediated cheap-talk procedures. The result...

Quitting games are n-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 riS, which depends on the set S of players that did choose to quit. If...

We study a selection game between two committee members (the players). They interview candidates sequentially and have to decide, after each interview, whether to hire the candidate or to interview the next candidate. Each player can either accept or reject the candidate, and if he rejects the...

We apply the average cost optimality equation to zero-sum Markov games, by considering a simple game with one-sided incomplete information that generalizes an example of Aumann and Maschler (1995). We determine the value and identify the optimal strategies for a range of parameters.

We show how a stochastic variation of a Ramsey's theorem can be used to prove the existence of the value, and to construct [var epsilon]-optimal strategies, in two-player zero-sum dynamic games that have certain properties.

This paper studies extensive form games with perfect information and simultaneous moves, henceforth called games with public information. On this class, we prove that all communication equilibrium payoffs can be obtained without mediator by cheap-talk procedures. The result encompasses repeated...

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