Anonymous user
Condorcet method: Difference between revisions
cut down text
imported>WikipediaBot m (importing text from Wikipedia) |
imported>DanKeshet (cut down text) |
||
Line 1:
Any election method conforming to the [[Condorcet criterion]] is known as a '''Condorcet method'''. The name comes from a deviser, the [[18th century]] [[mathematician]] and [[philosopher]] [[Marquis de Condorcet]], although the method was previously devised by [[Ramon Llull]] in the [[13th century]].
Line 68 ⟶ 66:
Examples of Condorcet methods include:
* '''[[Black]]''' chooses the Condorcet winner when it exists and otherwise the [[Borda count|Borda winner]]. It is named after
* '''[[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>
Line 202 ⟶ 200:
In this election, Nashville is the Condorcet winner and thus the winner under all possible Condorcet methods. Notice how [[first-past-the-post]] and [[instant-runoff voting]] would have respectively selected Memphis and Knoxville here, while compared to either of them, most people would have preferred Nashville.
== Use of Condorcet voting ==
Line 235 ⟶ 211:
# The voting procedure for the [[United Kingdom|uk]].* hierarchy of [[Usenet]]
#[http://www.rsabey.pwp.blueyonder.co.uk/rpc/fscc/ Five-Second Crossword Competition]
[[Category:Voting systems]]
|