AbstractConsider 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by World Scientific Publishing Co. Pte. Ltd. in its journal New Mathematics and Natural Computation.
Volume (Year): 08 (2012)
Issue (Month): 02 ()
Contact details of provider:
Web page: http://www.worldscinet.com/nmnc/nmnc.shtml
Find related papers by JEL classification:
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Mishra, Debasis & Roy, Souvik, 2012.
Games and Economic Behavior,
Elsevier, vol. 76(1), pages 285-300.
- Debasis Mishra & Souvik Roy, 2011. "Strategy-proof partitioning," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 11-06, Indian Statistical Institute, New Delhi, India.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim).
If references are entirely missing, you can add them using this form.