Finite complexity strategies suffice for approximating all subgame perfect equ ilibrium payoffs of repeated games. Generically, at such equilibria, no player's complexity exceeds the product of his opponents' complexi ties. Also, no player's memory exceeds the maximal memory of his oppo nents....

With many semi-anonymous players, the equilibria of simultaneous-move games are extensively robust. This means that the equilibria survive even if the simultaneous-play assumption is relaxed to allow for a large variety of extensive modifications. Such modifications include sequential play with...

Subjective utility maximizers, in an infinitely repeated game, will learn to predict opponents' future strategies and will converge to play according to a Nash equilibrium of the repeated game. Players' initial uncertainty is placed directly on opponents' strategies and the above result is...

A probability distribution governing the evolution of a stochastic process has infinitely many Bayesian representations of the form mu = integral operator [subscript theta] mu[subscript theta] delta lambda (theta). Among these, a natural representation is one whose components (mu[subscript...