Ranked Pairs: Difference between revisions

m
Line 232:
While Ranked Pairs behaves similarly to [[Schulze]], Ranked Pairs passes [[local independence of irrelevant alternatives]] whereas Schulze does not. Some authors argue that the Ranked Pairs method is more intuitive and easier to understand than Schulze as well.<ref name="Munger 2023 pp. 434–444">{{cite journal | last=Munger | first=Charles T. | title=The best Condorcet-compatible election method: Ranked Pairs | journal=Constitutional Political Economy | volume=34 | issue=3 | date=2023 | issn=1043-4062 | doi=10.1007/s10602-022-09382-w | pages=434–444}}</ref>
 
One disadvantage of Ranked Pairs is there's no easy way to detect ties for first place, as determining whether there exists a way to break ties between pairwise victories so that a given candidate wins is NP-complete.<ref name="Brill">{{cite journal | last=Brill | first=Markus | last2=Fischer | first2=Felix | title=The Price of Neutrality for the Ranked Pairs Method | journal=Proceedings of the AAAI Conference on Artificial Intelligence | publisher=Association for the Advancement of Artificial Intelligence (AAAI) | volume=26 | issue=1 | date=2012-07-26 | issn=2374-3468 | doi=10.1609/aaai.v26i1.8250 | pages=1299–1305}}</ref>. However, ties can still be broken fairly and efficiently (using some secondary method based on the ballots, such as selecting the candidate with the [[Graduated Majority Judgment|highest median score]]).
 
== Notes ==