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

A social choice rule (SCR) $F$ maps preference profiles to lotteries over some finite set of outcomes. $F$ is virtually implementable in (pure and mixed) Nash equilibria provided that for all $\epsilon 0$, there exists a mechanism such that for each preference profile $\theta$, its set of Nash...

We consider collective decision problems where some agents have private information about alternatives and others don't. Voting takes place under strategy-proof rules. Prior to voting, informed agents may or may not disclose their private information, thus eventually influencing the preferences...

This study explores mechanism design with allocation-based social preferences. Agents' social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents' social preferences...