Talk:Ranked Pairs: Difference between revisions
→Any Landau-independent variants?
| (2 intermediate revisions by 2 users not shown) | |||
Line 11:
: From another direction, it might be possible to create a Ranked Pairs version that does everything RP does but also elects from the uncovered set, even if it's not independent of covered candidates. Such a method has been discussed on EM under the name "short ranked pairs", but hasn't been fully fleshed out or implemented by anyone to my knowledge. [[User:Kristomun|Kristomun]] ([[User talk:Kristomun|talk]]) 13:08, 22 February 2024 (UTC)
:: Oof :( Oh well, independence of strongly-dominated alternatives is still pretty good!
::: I ''think'' so, but I never got a satisfactory proof on EM. You might want to contact [https://www.pik-potsdam.de/members/heitzig Jobst Heitzig] and ask. [[User:Kristomun|Kristomun]] ([[User talk:Kristomun|talk]]) 13:58, 23 February 2024 (UTC)
:::: Found answers to both my questions: 1. LIIA follows from independence of last-place alternatives and the construction of the River ordering, which means removing first-place candidates leads to the 2nd-place candidate winning. 2. The maximally-independent form of RP seems to be [[Stable voting]], but as you said, it violates monotonicity :( --[[User:Closed Limelike Curves|Closed Limelike Curves]] ([[User talk:Closed Limelike Curves|talk]]) 04:26, 1 March 2024 (UTC)
| |||