Abstract

“Independence of clones” is a generalization of the condition of not being subject to the perverse consequences of vote splitting that arise under plurality voting. A new voting rule that is at least “almost always” independent of clones is obtained by the following algorithm: Require the collective ranking of the candidates to be consistent with the paired comparisons decided by the largest and second largest margins, and then, if possible, with the paired comparison decided by the third largest margin, and so on. The advantages of this “ranked pairs” rule over previously proposed voting rules that are independent of clones is that it possesses Condorcet consistency, non-negative responsiveness, and “resolvability” (the property that every tie be within one vote of being broken).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.