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 robust virtual implementation, where robustness is the requirement that implementation succeed in all type spaces consistent with a given payoff type space as well as with a given space of first-order beliefs about the other agents’ payoff types. This last bit, which constitutes...

Suppose that the goals of a society can be summarized in a social choice rule, i.e., a mapping from relevant underlying parameters to final outcomes. Typically, the underlying parameters (e.g., individual preferences) are private information to the agents in society. The implementation problem...

Implementation in iteratively undominated strategies relies on permissive conditions. However, for the sufficiency results available, authors have relied on assumptions that amount to quasilinear preferences on a numeraire. We uncover a new necessary condition that implies that such assumptions...

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

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

Implementation in iteratively undominated strategies relies on permissive conditions. However, for the sufficiency results available, authors have relied on assumptions that amount to quasilinear preferences on a numeraire. We uncover a new necessary condition that implies that such assumptions...

Implementation in iteratively undominated strategies relies on permissive conditions. However, for the sufficiency results available, authors have relied on assumptions that amount to quasilinear preferences on a numeraire. We uncover a new necessary condition that implies that such assumptions...

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