Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Ranked pairs
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Criteria == Of the formal [[voting criteria]], the ranked pairs method passes the [[Majority favorite criterion|majority criterion]], the [[monotonicity criterion]], the [[Smith criterion]] (which implies the [[Condorcet criterion]]), the [[Condorcet loser criterion]], and the [[independence of clones criterion]]. Ranked pairs fails the [[consistency criterion]] and the [[participation criterion]]. While ranked pairs is not fully [[Independence of irrelevant alternatives|independent of irrelevant alternatives]], it still satisfies [[Independence of irrelevant alternatives#Local independence|local independence of irrelevant alternatives]] and [[independence of Smith-dominated alternatives]], meaning it is likely to roughly satisfy IIA "in practice." === Independence of irrelevant alternatives ===<!--This section is linked from [[Condorcet method]]--> Ranked pairs fails [[independence of irrelevant alternatives]], like all other [[Ranked voting|ranked voting systems]]. However, the method adheres to a less strict property, sometimes called [[independence of Smith-dominated alternatives]] (ISDA). It says that if one candidate (X) wins an election, and a new alternative (Y) is added, X will win the election if Y is not in the [[Smith set]]. ISDA implies the Condorcet criterion. === Comparison table === The following table compares ranked pairs with other single-winner election methods:{{Comparison of Schulze to preferential voting systems}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)