# Kemeny–Young method

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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: [[Tactical voting|compromising, burying], and crowding.