Condorcet ranking: Difference between revisions
→Notes
No edit summary |
(→Notes) |
||
Line 243:
== Notes ==
Methods that produce Condorcet rankings (and also Smith rankings) include [[Copeland's method]], [[Pairwise Sorted Methods]], [[Schulze]], [[Ranked Pairs]], and [[Kemeny-Young]].
Smith set rankings can be given additional context by showing for each Smith set the weakest pairwise victory anyone in that Smith set has against anyone in a lower-ranked Smith set. So, for example, if there are 4 candidates, with 3 of them in a cycle and each of them having a 65%, 60%, and 55% victory respectively against the fourth candidate, then 55% could be used to describe the minimum strength of the candidates in the set against the lower-ranked candidate.
The generalized Smith ranking can also be found by finding all candidates in the Smith set, equally ranking each of them, then eliminating all of them and finding the secondary Smith set (the Smith set now that the original Smith set has been eliminated) and equally ranking each of them lower than the candidates in the Smith set, and repeating until all candidates are ranked.
| |||