Non-bossy social classification

DOI10.1016/J.MATHSOCSCI.2011.07.004zbMATH Open1237.91187OpenAlexW2140474478MaRDI QIDQ418045FDOQ418045

Authors: Dinko Dimitrov, Clemens Puppe 

Publication date: 14 May 2012

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000022997

Recommendations

• Non-manipulable partitioning
• Collective rationality in graph aggregation
• Graph aggregation
• Non-bossiness
• Asking infinite voters `who is a J?': group identification problems in \(\mathbb{N} \)

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• On the question ``who is a \(J\)?: a social choice approach
• Strategy-Proof Allocation Mechanisms at Differentiable Points
• On the use of ordered sets in problems of comparison and consensus of classifications
• Between liberalism and democracy.
• Procedural group identification
• Aggregation of equivalence relations
• Comments on ``Aggregation of equivalence relations by P. C. Fishburn and A. Rubinstein
• Separability and aggregation of equivalence relations
• Group identification
• Simple collective identity functions
• ``I want to be a J!: Liberalism in group identification problems

Cited In (6)

• Separability and aggregation of equivalence relations
• Collective identity functions with status quo
• The problem of collective identity in a fuzzy environment
• Non-manipulable partitioning
• On social groups and relations
• Classification aggregation without unanimity

This page was built for publication: Non-bossy social classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418045)