Condorcet method: Difference between revisions
Explained two quick ways to find the CW from the pairwise matrix.
(Added some clarification on Condorcet cycles, Smith//Score, and added section on how Condorcet can be modified to allow fractional votes in pairwise matchups.) |
(Explained two quick ways to find the CW from the pairwise matrix.) |
||
Line 39:
The sum of all ballot matrices, the '''Condorcet pairwise matrix''', is the primary piece of data used to resolve majority rule cycles.
Sequential comparison is the fastest generalized way to determine the Condorcet winner, when one exists, from the pairwise matrix: order all of the candidates, pairwise compare the first two, eliminate the loser of the match up, and repeat until only one candidate remains, and then check whether this remaining candidate wins all of their pairwise matchups. Condorcet winners may often have a lot of 1st choice votes, especially in less contested elections, so it may be even faster to first check whether those types of candidates can win all of their pairwise matchups.
== Key terms in ambiguity resolution ==
| |||