Kemeny–Young method: Difference between revisions
Content added Content deleted
imported>Allens (Initial creation of page) |
imported>Allens (Reformat) |
||
| Line 4: | Line 4: | ||
the sum across all such pairs. The ranking with the least distance wins. |
the sum across all such pairs. The ranking with the least distance wins. |
||
Strategies this method is vulnerable to: [[Tactical voting|compromising, burying], and [[Strategic nomination|crowding]]. |
Strategies this method is vulnerable to: [[Tactical voting|compromising]], [[Tactical voting|burying]], and [[Strategic nomination|crowding]]. |
||
==External links== |
==External links== |
||
Revision as of 21:30, 5 November 2005
Each possible complete ranking of the candidates is given a "distance" score. For each pair of candidates, find the number of ballots that order them the the opposite way as the given ranking. The distance is the sum across all such pairs. The ranking with the least distance wins.
Strategies this method is vulnerable to: compromising, burying, and crowding.
External links
Most text of this article is derived with permission from Electoral Methods: Single Winner.