Library Header Image
LSE Research Online LSE Library Services

Non-manipulable partitioning

Duddy, Conal, Perote-Peña, Juan and Piggins, Ashley (2012) Non-manipulable partitioning. New Mathematics and Natural Computation, 08 (02). pp. 273-282. ISSN 1793-0057

Full text not available from this repository.
Identification Number: 10.1142/S1793005712400157


Consider the following social choice problem. A group of individuals seek to classify the elements of X as belonging in one of two sets. The individuals may disagree as to how the elements of X should be classified, and so an aggregation rule is applied to determine a compromise outcome. We require that the social classification should not be imposed, nor should it be manipulable. We prove that the only aggregation rules satisfying these properties are dictatorships.

Item Type: Article
Official URL:
Additional Information: © 2012 World Scientific
Divisions: Philosophy, Logic and Scientific Method
Subjects: J Political Science > JC Political theory
Date Deposited: 10 Aug 2012 10:30
Last Modified: 16 May 2024 01:27

Actions (login required)

View Item View Item