Condorcet method: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 109:
Other terms related to the Condorcet method are:
* '''[[Condorcet loser]]''': the candidate who is less preferred than every other candidate in a [[pairwise matchup]].
* '''weak Condorcet winner''': a candidate who beats or ties with every other candidate in a pairwise matchup. There can be more than one weak Condorcet winner.
* '''weak Condorcet loser''': a candidate who is defeated by or ties with every other candidate in a pair wise matchup. Similarly, there can be more than one weak Condorcet loser.
Line 258:
== Notes ==
All Condorcet methods pass the [[Mutual majority criterion|mutual majority criterion]] when there is a Condorcet winner. This is because the CW is guaranteed to be a member of any set of candidates that can pairwise beat all candidates not in the set, and the mutual majority set is such a set, because all candidates in it are ranked by a majority over all candidates not in the set. [[Smith-efficient]] Condorcet methods always pass the [[Mutual majority criterion|mutual majority criterion]].
One concern with Condorcet methods is that it is very difficult to do [[Pairwise counting|pairwise counting]] for elections with 10 of more candidates, since that is at least (0.5*10*((10-1)=9))=45 pairwise matchups to record the details of. Allowing write-in candidates makes things even more complex. One possible solution would be to have a primary beforehand using a voting method better than [[FPTP]] to pick 5 top candidates, and then only allow voters to rank those top 5. For all other candidates, they'd be able to approve or score each of them. The rated information could then be used to elect someone other than one of the top 5 when the non-top 5 candidates have significantly higher ratings, but otherwise only elect one of the top 5. The primary itself could be made slightly semi-proportional as well. {{fromwikipedia}}▼
▲One concern with Condorcet methods is that it is very difficult to do [[
== External links ==
| |||