We study the existence of uniform correlated equilibrium payoffs 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...

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 prove the existence of the maxmin of zero-sum recursive games with one sided information.

We prove that, in every stochastic game with finitely many states and actions, there exists at least one state, starting from which an equilibrium payoff exists. This is achieved by proving that there exists a solvable set. This generalizes to an arbitrary number of players a result due to...

This article studies situations in which agents do not initially know the effect of their decisions, but learn from experience the payoffs induced by their choices and their opponents'. We chararacterize equilibrium payoffs in terms of simple strategies in which an exploration phase is followed...

We study a class of symmetric strategic experimentation games. Each of two players faces an (exponential) two-armed bandit problem, and must decide when to stop experimenting with the risky arm. The equilibrium amount of experimentation depends on the degree to which experimentation outcomes are...

We consider the “and” communication device that receives inputs from two players and outputs the public signal yes if both messages are yes, and outputs no otherwise. We prove that no correlation can securely be implemented using this device, even when infinitely many stages of communication...

We study the structure of the set of equilibrium payoffs in finite games, both for Nash equilibrium and correlated equilibrium. A nonempty subset of R^2 is shown to be the set of Nash equilibrium payoffs of a bimatrix game if and only if it is a finite union of rectangles. Furthermore, we show...