Ranked Pairs: Difference between revisions

It's my understanding that Dr. Tideman prefers calling this method "Ranked Pairs".
m (→‎Tally: There was a comma in the wrong spot.)
(It's my understanding that Dr. Tideman prefers calling this method "Ranked Pairs".)
Line 1:
{{Wikipedia|Ranked pairs}}
 
The "'''Ranked Pairs'''" method (sometimes abbreviated as "RP") orwas '''Tideman'''created (namedin after1987 by [[Nicolaus Tideman]]). It is a [[voting system]] that selects a single winner using votes that express preferences. RPThe ranked-pairs method can also be used to create a sorted list of winners. RPRanked Pairs passes the [[Smith criterion]] and the [[Condorcet Criterionwinner criterion]], and(thus ismaking by definitionit a '''"[[Condorcet method]]'''"). RPThe ranked-pairs method has many variations such as the "[[Maximize Affirmed Majorities]]" (or "MAM") and "[[Maximum Majority Voting]]" (or "MMV") voting methods.
 
== Procedure ==
 
The RPranked-pairs procedure isworks as follows:
# Tally the vote count comparing each pair of candidates, and determine the winner of each pair (provided there is not a tie)
# Sort (rank) each pair, by the largest margin of victory first to smallest last.
Line 12:
See the [[Ranked pairs#Notes|Notes]] section for information on finding the Ranked Pairs winner without constructing a graph.
 
RPRanked Pairs can also be used to create a sorted list of preferred candidates. To create a sorted list, repeatedly use the procedure to do the following:
To create a sorted list, repeatedly use RP to* select a winner,
* remove that winner from the list of candidates,
* ...and repeat (to find the next runner up, and so forth). A simpler way to create the sorted list is simply to run RP once, and then use the resulting [[Condorcet ranking]] (when ignoring the defeats that were ignored by the RP procedure) as the RP ranking.
 
A simpler way to create the sorted list is simply to run Ranked Pairs once, and then use the resulting [[Condorcet ranking]] (when ignoring the defeats that were ignored by the ranked-pairs procedure) as the ranked-pairs ranking.
 
=== Tally ===