Artikel
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 this environment, and prove that some well-known SCCs are Maskin monotonic ( but they do not satisfy no-veto power) and hence Nash implementable.
- Language
-
Englisch
- Bibliographic citation
-
Journal: Games ; ISSN: 2073-4336 ; Volume: 4 ; Year: 2013 ; Issue: 1 ; Pages: 38-49 ; Basel: MDPI
- Classification
-
Wirtschaft
Noncooperative Games
- Subject
-
Nash implementation
allocation problem
single-dipped preferences
- Event
-
Geistige Schöpfung
- (who)
-
Doghmi, Ahmed
- Event
-
Veröffentlichung
- (who)
-
MDPI
- (where)
-
Basel
- (when)
-
2013
- DOI
-
doi:10.3390/g4010038
- Handle
- Last update
-
10.03.2025, 11:44 AM CET
Data provider
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Artikel
Associated
- Doghmi, Ahmed
- MDPI
Time of origin
- 2013