Ranked Pairs: Difference between revisions
m
no edit summary
(Cleaned up Smith compliance proof, and elaborated on what tiebreaker is most commonly associated with RP.) |
mNo edit summary |
||
| (One intermediate revision by the same user not shown) | |||
Line 1:
{{Wikipedia|Ranked pairs}}
The "'''Ranked Pairs'''" method (sometimes abbreviated as "RP") was created in 1987 by [[Nicolaus Tideman]].<ref name="Tideman2">{{Cite journal |last=Tideman |first=T. N. |date=1987-09-01 |title=Independence of clones as a criterion for voting rules |url=https://doi.org/10.1007/BF00433944 |journal=Social Choice and Welfare |language=en |volume=4 |issue=3 |pages=185–206 |doi=10.1007/BF00433944 |issn=1432-217X}}</ref> It is a [[voting system]] that selects a single winner using votes that express preferences. The ranked-pairs method can also be used to create a sorted list of winners. Ranked Pairs passes the [[Smith criterion]] and the [[Condorcet winner criterion]] (thus making it a "[[Condorcet method]]"). The ranked-pairs method has many variations such as the "[[Maximize Affirmed Majorities]]" (or "MAM") and "[[Maximum Majority Voting]]" (or "MMV") voting methods.
== Procedure ==
| |||