2000 character limit reached
Breaking ties in collective decision making
Published 30 Jun 2017 in math.CO and math.GR | (1706.10165v4)
Abstract: Many classical social preference (multiwinner social choice) correspondences are resolute only when two alternatives and an odd number of individuals are considered. Thus, they generally admit several resolute refinements, each of them naturally interpreted as a tie-breaking rule. In this paper we find out conditions which make a social preference (multiwinner social choice) correspondence admit a resolute refinement fulfilling suitable weak versions of the anonymity and neutrality principles, as well as reversal symmetry (immunity to the reversal bias).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.