We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to one for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of...

We study perfect information games with an infinite horizon played by an arbitrary number of players. This class of games includes infinitely repeated perfect information games, repeated games with asynchronous moves, games with long and short run players, games with overlapping generations of...

We apply the stochastic evolutionary approach of equilibrium selection to macroeconomic models in which a complementarity at the macro level is present. These models often exhibit multiple Pareto-ranked Nash equilibria, and the best response-correspondence of an individual increases with a...

We examine contemporaneous perfect equilibria, in which a player's actions after every history, evaluated at the point of deviation from the equilibrium, must be within of a best response. This concept implies, but is not implied by Radner's ex ante perfect equilibrium. A strategy profile is a...

We introduce a framework for analyzing Bertrand-Edgeworth equilibria in finite Arrow-Debreu exchange economies. A key feature is the way trade takes place. There are two main stages. In the first stage agents simultaneously choose prices and quantities of commodities they want to sell; in the...

This paper is the first to introduce an algorithm to compute stationary equilibria in stochastic games, and shows convergence of the algorithm for almost all such games. Moreover, since in general the number of stationary equilibria is overwhelming, we pay attention to the issue of equilibrium...

In an intertemporal general equilibrium framework, we compare a Cournot equilibrium to the Walras equilibrium. The Cournot agents trade and invest less than the Walras agents. This generates an ineffciency which does not vanish as the number of Cournot agents tends to infinity. A larger number...

We provide tight bounds on the rate of convergence of the equilibrium payoff sets for repeated games under both perfect and imperfect public monitoring. The distance between the equilibrium payoff set and its limit vanishes at rate (1 - delta)^{1/2} under perfect monitoring, and at rate (1 -...

This paper characterizes an equilibrium payoff subset for dynamic Bayesian games as discounting vanishes. Monitoring is imperfect, transitions may depend on actions, types may be correlated and values may be interdependent. The focus is on equilibria in which players report truthfully. The...

I propose a simple simulation procedure for large games with multiple equilibria. The simulation procedure is based on a best-response dynamic. The implied equilibrium selection mechanism is intuitive: more stable equilibria are selected with higher probability