The evolution of boundedly rational rules for playing normal form games is studied within stationary environments of stochastically changing games. Rules are viewed as algorithms prescribing strategies for the different normal form games that arise. It is shown that many of the folk results of...

By identifying types whose low-order beliefs – up to level li – about the state of nature coincide, we obtain quotient type spaces that are typically smaller than the original ones, preserve basic topological properties, and allow standard equilibrium analysis even under bounded reasoning....

We extend Aumann's [3] theorem, deriving correlated equilibria as a consequence of common priors and common knowledge of rationality, by explicitly allowing for non-rational behavior. We replace the assumption of common knowledge of rationality with a substantially weaker one, joint p-belief of...

This paper is concerned with the realism of mechanisms that implement social choice functions in the traditional sense. Will agents actually play the equilibrium assumed by the analysis? As an example, we study the convergence and stability properties of Sj\"ostr\"om's (1994) mechanism, on the...

This paper studies the equilibrating process of several implementation mechanisms using naive adaptive dynamics. We show that the dynamics converge and are stable, for the canonical mechanism of implementation in Nash equilibrium. In this way we cast some doubt on the criticism of ``complexity''...