Restricting attention to economic environments, we study implementation under perturbed better-response dynamics (BRD). A social choice function (SCF) is implementable in stochastically stable strategies of perturbed BRD whenever the only outcome supported by the stochastically stable strategies...

We study the classic implementation problem under the behavioral assumption that agents myopically adjust their actions in the direction of better-responses within a given institution. We offer results both under complete and incomplete information. First, we show that a necessary condition for...

We study the classic implementation problem under the behavioral assumption that agents myopically adjust their actions in the direction of better-responses within a given institution. We offer results both under complete and incomplete information. First, we show that a necessary condition for...

We explore the consequences of the assumptions used in modern cryptographywhen applied to repeated games with public communication. Technically speaking, we model agents by polynomial Turing machinesand assume the existence of a trapdoor function. Under these conditions, we prove a Folk Theorem...

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

Given any observed demand behavior by means of a demand function, we quantify by how much it departs from rationality. Using a recent elaboration of the "almost implies near" principle, the measure of the gap is the smallest norm of the correcting matrix that would yield a Slutsky matrix with...

We present a new notion of cardinal revealed preference that exploits the expenditure information in classical consumer theory environments with finite data. We propose a new behavioral axiom, Acyclic Enticement (AE), that requires the acyclicity of the cardinal revealed-preference relation. AE...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

We consider mechanism design in contexts in which agents exhibit bounded depth of reasoning (level k) instead of rational expectations. We use simple direct mechanisms, in which agents report only first-order beliefs. While level 0 agents are assumed to be truth tellers, level k agents...