Resolute refinements of social choice correspondences

DOI10.1016/J.MATHSOCSCI.2016.08.007MaRDI QIDQ502364zbMATH OpenOpenAlexFDO

Authors Daniela Bubboloni, Michele Gori

Publication date 5 January 2017

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

Full work available at URL https://arxiv.org/abs/1506.06069

zbMATH Keywords

anonymityneutralityresolute refinementsocial choice correspondences

Mathematics Subject Classification ID

Social choice (91B14)

Abstract: Many classical social choice correspondences are resolute only in the case of two alternatives and an odd number of individuals. Thus, in most cases, they admit several resolute refinements, each of them naturally interpreted as a tie-breaking rule, satisfying different properties. In this paper we look for classes of social choice correspondences which admit resolute refinements fulfilling suitable versions of anonymity and neutrality. In particular, supposing that individuals and alternatives have been exogenously partitioned into subcommittees and subclasses, we find out arithmetical conditions on the sizes of subcommittees and subclasses that are necessary and sufficient for making any social choice correspondence which is efficient, anonymous with respect to subcommittees, neutral with respect to subclasses and possibly immune to the reversal bias admit a resolute refinement sharing the same properties.

Recommendations

• Breaking ties in collective decision-making
• On strategy-proof social choice correspondences
• The finer structure of resolute, neutral, and anonymous social choice correspondences
• Characterizing the resolute part of monotonic social choice correspondences
• Anonymous, neutral, and resolute social choice revisited

Cites work

• Anonymity, monotonicity, and limited neutrality: selecting a single alternative from a binary agenda
• Anonymous and neutral majority rules
• Concorcet's principle implies the no show paradox
• Condorcet Social Choice Functions
• Consequences of reversing preferences
• Geometry of voting
• scientific article; zbMATH DE number 3864918 (Why is no real title available?)
• scientific article; zbMATH DE number 3445421 (Why is no real title available?)
• Majority selection of one alternative from a binary agenda
• On the reversal bias of the minimax social choice correspondence
• Symmetric majority rules
• The finer structure of resolute, neutral, and anonymous social choice correspondences

Cited in

(14)

• On two new social choice correspondences.
• Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom
• Breaking ties in collective decision-making
• Anonymous, neutral, and resolute social choice revisited
• Anonymous and neutral social choice: a unified framework for existence results, maximal domains and tie-breaking
• The flow network method
• Strategy-proof resolute social choice correspondences
• Independent social choice correspondences
• On the reversal bias of the minimax social choice correspondence
• Characterizing the resolute part of monotonic social choice correspondences
• The finer structure of resolute, neutral, and anonymous social choice correspondences
• Resolute and symmetric mechanisms for two-sided matching problems
• Symmetry groups for social preference functions
• On the enumeration of resolute majority rules

This page was built for publication: Resolute refinements of social choice correspondences

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