.png){kind=icon}
.png){kind=icon}
Return
Priority domains
.png){kind=icon}
PRE
AI
DOI：10.1007/s00355-025-01647-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the classical problem of allocating m objects to n agents where m >= n. In the m = n case, we analyze preference domains (called UPN-priority domains) whereeverystrategy-proof,non-bossyandunanimousprofileneutral(UPN)allocation rule is a priority rule. We show that a simple condition called the closure property characterizes priority domains. The only domain satisfying the closure property and a mild richness condition is the universal domain. We extend this result to the m > n case. We also consider the case where allocation rules satisfy a stronger neutrality property.
Keywords:
STRATEGY-PROOF ALLOCATION
ASSIGNMENT
MONOTONICITY
PREFERENCES
MECHANISMS
Journal
S
IF:
0.8
Papers:
35
Citations:
0