Non-bossy social classification
We consider the problem of how societies should be partitioned into classes if individuals express their views about who should be put with whom in the same class. A non-bossy social aggregator depends only on those cells of the individual partitions the society members classify themselves in. This fact allows us to concentrate on a corresponding “opinion graph” for each profile of views. By means of natural sovereignty, liberalism, and equal treatment requirements, we characterize the non-bossy aggregators generating partitions in which the social classes are refinements of the weakly connected components of the opinion graph.
If 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.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Dov Samet & David Schmeidler, 1999.
"Between Liberalism and Democracy,"
Game Theory and Information
- Murat Çengelci & M. Sanver, 2010. "Simple Collective Identity Functions," Theory and Decision, Springer, vol. 68(4), pages 417-443, April.
- Mark A. Satterthwaite & Hugo Sonnenschein, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," Review of Economic Studies, Oxford University Press, vol. 48(4), pages 587-597.
- Nicolas, Houy, 2007. ""I want to be a J!": Liberalism in group identification problems," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 59-70, July.
- Miller, Alan D., 2008. "Group identification," Games and Economic Behavior, Elsevier, vol. 63(1), pages 188-202, May.
- Peter Fishburn & Ariel Rubinstein, 1986. "Aggregation of equivalence relations," Journal of Classification, Springer;The Classification Society, vol. 3(1), pages 61-65, March.
- Dimitrov, Dinko & Sung, Shao Chin & Xu, Yongsheng, 2007.
"Procedural group identification,"
Mathematical Social Sciences,
Elsevier, vol. 54(2), pages 137-146, September.
- Dimitrov, Dinko & Sung, Shao Chin & Xu, Yongsheng, 2011. "Procedural group identification," Center for Mathematical Economics Working Papers 383, Center for Mathematical Economics, Bielefeld University.
- Dimitrov, D.A. & Sung, S.C. & Xu, Y., 2003. "Procedural Group Identification," Discussion Paper 2003-10, Tilburg University, Center for Economic Research.
- Jean-Pierre Barthélemy & Bruno Leclerc & Bernard Monjardet, 1986. "On the use of ordered sets in problems of comparison and consensus of classifications," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 187-224, September.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:62:y:2011:i:3:p:162-165. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.