Nash implementation in an allocation problem with single-dipped preferences

Abstract

In this paper, we study the Nash implementation in an allocation problem with single-dipped preferences. We show that, with at least three agents, Maskin monotonicity is necessary and sufficient for implementation. We examine the implementability of various social choice correspondences (SCCs) in this environment, and prove that some well-known SCCs are Maskin monotonic (but they do not satisfy no-veto power) and hence Nash implementable. © 2013 by the author; licensee MDPI, Basel, Switzerland.