Kemeny–Young method: Difference between revisions
Content added Content deleted
(Removing banner) |
m (changed "the the" to "the") |
||
| Line 3: | Line 3: | ||
Each possible complete ranking of the candidates is given a "distance" |
Each possible complete ranking of the candidates is given a "distance" |
||
score. For each pair of candidates, find the number of ballots that |
score. For each pair of candidates, find the number of ballots that |
||
order them |
order them the opposite way as the given ranking. The distance is |
||
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. |
||