Condorcet method: Difference between revisions
→Different ambiguity resolution methods: interwiki link
Psephomancy (talk | contribs) (wikitable) |
Psephomancy (talk | contribs) (→Different ambiguity resolution methods: interwiki link) |
||
Line 69:
* '''[[Minmax|Minimax]]''' (also called '''Simpson''') chooses the candidate whose worst pairwise defeat is less bad than that of all other candidates.<sup>1</sup>
* '''Smith/Minimax''' restricts the Minimax algorithm to the Smith set.<sup>1</sup>
* '''[[Ranked Pairs]]''' (RP) or '''Tideman''' (named after [[w:Nicolaus Tideman|Nicolaus Tideman]]) with variations such as '''[[Maximize Affirmed Majorities]]''' (MAM) and '''[[Maximum Majority Voting]]''' (MMV)<sup>1</sup>
* '''[[Schulze method|Schulze]]''' with several reformulations/variations, including '''Schwartz Sequential Dropping (SSD)''' and '''Cloneproof Schwartz Sequential Dropping (CSSD)'''<sup>1</sup>
* '''[[Approval-Condorcet Hybrids]]''', such as '''[[Definite Majority Choice]]''', use an [[Approval Cutoff]] to augment the Condorcet pair wise array. Many believe that such a method would make a good first-round public proposal.
| |||