A Theorem on Aggregating Classifications

Philippe Mongin and Francois Maniquet

No 1116, HEC Research Papers Series from HEC Paris

Abstract: Suppose that a group of individuals must classify objects into three or more categories, and does so by aggregating the individual classifications. We show that if the classifications, both individual and collective, are required to put at least one object in each category, then no aggregation rule can satisfy a unanimity and an independence condition without being dictatorial. This impossibility theorem extends a result that Kasher and Rubinstein (1997) proved for two categories and complements another that Dokow and Holzman (2010) obtained for three or more categories under the condition that classifications put at most one object in each category. The paper discusses an interpretation of its result both in terms of Kasher and Rubinstein's group identification problem and in terms of Dokow and Holzman's task assignment problem.

Keywords: Aggregation of classifications; Group identification problem; Task assignment problem; Nonbinary evaluations (search for similar items in EconPapers)
JEL-codes: C65 D71 (search for similar items in EconPapers)
Pages: 11 pages
Date: 2015-10-26
New Economics Papers: this item is included in nep-mic
References: Add references at CitEc
Citations:

Downloads: (external link)
http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2686037 (application/pdf)

Related works:
Journal Article: A theorem on aggregating classifications (2016)
Working Paper: A theorem on aggregating classifications (2016)
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:ebg:heccah:1116

Access Statistics for this paper

More papers in HEC Research Papers Series from HEC Paris HEC Paris, 78351 Jouy-en-Josas cedex, France. Contact information at EDIRC.
Bibliographic data for series maintained by Antoine Haldemann ().