Resolute refinements of social choice correspondences

Daniela Bubboloni and Michele Gori

Mathematical Social Sciences, 2016, vol. 84, issue C, 37-49

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.

Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489616300695
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Resolute refinements of social choice correspondences (2016)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:84:y:2016:i:c:p:37-49

DOI: 10.1016/j.mathsocsci.2016.08.007

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().