HEC Research Papers Series,
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

JEL-codes: C65; D71

11 pages, October 26, 2015

Full text files

papers.cfm?abstract_id=2686037  

Download statistics

• HEC Paris
• Ordering Working Papers
• Home page for this series

Questions (including download problems) about the papers in this series should be directed to Antoine Haldemann ()
Report other problems with accessing this service to Sune Karlsson ().

RePEc:ebg:heccah:1116This page generated on 2024-09-13 22:19:53.