Papers
Topics
Authors
Recent
Search
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).

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.