Condorcet method: Difference between revisions

no edit summary
No edit summary
No edit summary
Line 64:
Examples of Condorcet methods include:
* '''[[Black]]''' chooses the Condorcet winner when it exists and otherwise the [[Borda count|Borda winner]]. It is named after Duncan Black.
* '''[[Baldwin]]''' Computes the [[Borda count|Borda winner]] for all candidates, then iteratively deletes the candidate with the lowest count.
* '''[[Smith/IRV]]''' is [[instant-runoff voting]] with the candidates restricted to the Smith set.
* '''[[Copeland's method|Copeland]]''' selects the candidate that wins the most pairwise matchups. Note that if there is no Condorcet winner, Copeland will often still result in a tie.
Anonymous user