Nash implementation in an allocation problem with single-dipped preferences (Q2351207): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3390/g4010038 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151097991 / rank | |||
Normal rank | |||
Revision as of 01:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nash implementation in an allocation problem with single-dipped preferences |
scientific article |
Statements
Nash implementation in an allocation problem with single-dipped preferences (English)
0 references
23 June 2015
0 references
Summary: 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.
0 references
Nash implementation
0 references
allocation problem
0 references
single-dipped preferences
0 references
