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

We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict (and thus stronger) version of the monotonicity condition introduced by Maskin (1999) is necessary under the solution concept of rationalizability. Assuming the social...

This note studies (full) implementation of social choice functions under complete information in (correlated) rationalizable strategies. The monotonicity condition shown by Maskin (1999) to be necessary for Nash implementation is also necessary under the more stringent solution concept. We show...

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