Notions of anonymity for object assignment: impossibility theorems

Hikaru Kondo and Shigehiro Serizawa

ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka

Abstract: We search for impartiality in the allocation of objects when monetary transfers are not possible. Our main focus is anonymity. The standard definition requires that if agents' names are permuted, their assignments should be permuted in the same way. Since no rule satisfies this definition in this model, we introduce weaker variants, "anonymity on distinct preferences," "pairwise-anonymity on distinct preferences," "pairwise-anonymity on distinct profiles," and "independence of others' permutations." We show that for more than two agents and two objects, no rule is pairwise-anonymous on distinct preferences and Pareto-efficient (Theorem 1), no rule is pairwise-anonymous on distinct preferences and independent of others' permutations (Theorem 2), and no rule is pairwise-anonymous on distinct profiles and strategy-proof (Theorem 3). These results suggest that introducing randomization to object allocation problems is almost inevitable for achieving impartiality.

Date: 2015-03
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.iser.osaka-u.ac.jp/static/resources/docs/dp/2015/DP0927.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:dpr:wpaper:0927

Access Statistics for this paper

More papers in ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka Contact information at EDIRC.
Bibliographic data for series maintained by Librarian ().