Nash Implementation in an Allocation Problem with Single-Dipped Preferences
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 th...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2013-01-01
|
| Series: | Games |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-4336/4/1/38 |