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

We provide a characterization of virtual Bayesian implementation in pure strategies for environments satisfying no-total-indifference. A social choice function in such environments is virtually Bayesian implementable if and only if it satisfies incentive compatibility and a condition we term...

It is well known that a social choice function is truthfully implementable in Bayesian Nash equilibrium if and only if it is incentive compatible. However, in general it is not possible to rule out other equilibrium outcomes, and additional conditions, e.g., Bayesian monotonicity, are needed to...

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

We come close to characterizing the class of social choice correspondences that are implementable in rationalizable strategies. We identify a new condition, which we call set-monotonicity, and show that it is necessary and almost sufficient for rationalizable implementation. Set-monotonicity is...

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

Experimental studies on decision making based on advice received from others find that the weight put on the advice is negatively related to the distance between the advice and the decisionmaker's initial opinion. In this paper, we show that the distance effect can follow from rational signal...

We consider an allocation problem with a finite number of objects, and agents that demand at most one of the objects. The study provides a characterization of a class of strategy-proof price mechanisms. A mechanism belongs to the class if and only if the price space is restricted in a special...

Motivated by school admission systems used in, e.g., Turkey and Sweden, this paper investigates a sequential two-stage admission system with public and private schools. To perform the analysis, relevant axioms and equilibrium notions need to be tailored for the considered dynamic setting. In...

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