Stochastic fictitious play (SFP) assumes that agents do not try to influence the future play of their current opponents, an assumption that is justified by appeal to a setting with a large population of players who are randomly matched to play the game. However, the dynamics of SFP have only...

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

We show that in all (whether generic or nongeneric) binary-action supermodular games, an extreme action profile is robust to incomplete information if and only if it is a monotone potential maximizer. The equivalence does not hold for nonextreme action profiles