A theorem on aggregating classifications

Francois Maniquet and Philippe Mongin

Mathematical Social Sciences, 2016, vol. 79, issue C, 6-10

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.

Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489615000852
Full text for ScienceDirect subscribers only

Related works:
Working Paper: A theorem on aggregating classifications (2016)
Working Paper: A Theorem on Aggregating Classifications (2015)
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:eee:matsoc:v:79:y:2016:i:c:p:6-10

DOI: 10.1016/j.mathsocsci.2015.10.001

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().