Anonymous user
Condorcet method: Difference between revisions
→Different ambiguity resolution methods: fix link
(WikipediaBot - Robot: Changing category Voting systems) |
imported>DanKeshet (→Different ambiguity resolution methods: fix link) |
||
Line 69:
* '''[[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.
* '''[[Minimax]]''' (also called '''Simpson''') chooses the candidate whose worst pair wise 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 [[Nicolaus Tideman]]) with variations such as '''[[Maximize Affirmed Majorities]]''' (MAM) and '''[[Maximum Majority Voting]]''' (MMV)<sup>1</sup>
| |||