This paper studies equilibrium selection in binary supermodular games based on perfect foresight dynamics. We provide complete characterizations of absorbing and globally accessible equilibria and apply them to two subclasses of games. First, for unanimity games, it is shown that our selection...

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

This paper provides a dual characterization of the limit set of perfect public equilibrium payoffs in stochastic games (in particular, repeated games) as the discount factor tends to one. As a first corollary, the folk theorems of Fudenberg, Levine and Maskin (1994), Kandori and Matsushima...

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