Next Article in Journal
Tacit Collusion under Fairness and Reciprocity
Previous Article in Journal
An Equilibrium Analysis of Knaster’s Fair Division Procedure
Games 2013, 4(1), 38-49; doi:10.3390/g4010038
Article

Nash Implementation in an Allocation Problem with Single-Dipped Preferences

1,2
Received: 25 November 2012 / Revised: 10 January 2013 / Accepted: 15 January 2013 / Published: 30 January 2013
View Full-Text   |   Download PDF [404 KB, 19 February 2013; original version 30 January 2013]   |   Browse Figures

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.
Keywords: Nash implementation; allocation problem; single-dipped preferences Nash implementation; allocation problem; single-dipped preferences
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote
MDPI and ACS Style

Doghmi, A. Nash Implementation in an Allocation Problem with Single-Dipped Preferences. Games 2013, 4, 38-49.

View more citation formats

Article Metrics

For more information on the journal, click here

Comments

Cited By

[Return to top]
Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert