European Business Schools Librarian's Group
Home About Series Subject/JEL codes Advanced Search
HEC Paris. Research Department Les Cahiers de Recherche - HEC Paris

No 1116:
A Theorem on Aggregating Classifications

Philippe Mongin () and Francois Maniquet

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; (follow links to similar papers)

JEL-Codes: C65; D71; (follow links to similar papers)

11 pages, October 26, 2015

Before downloading any of the electronic versions below you should read our statement on copyright.
Download GhostScript for viewing Postscript files and the Acrobat Reader for viewing and printing pdf files.

Full text versions of the paper:

papers.cfm?abstract_id=2686037    PDF-file
Download Statistics

Questions (including download problems) about the papers in this series should be directed to Sandra Dupouy ()
Report other problems with accessing this service to Sune Karlsson () or Helena Lundin ().

Programing by
Design Joakim Ekebom

Handle: RePEc:ebg:heccah:1116 This page was generated on 2016-06-15 14:56:32