Talk:Ranked Pairs: Difference between revisions
no edit summary
No edit summary |
|||
Line 6:
What the title says. Right now, RP seems to be the "best available" Condorcet system (it's a top-shelf method alongside STAR). Can we make it even better? What's the strongest possible independence criterion we could get; Landau seems achievable. What about Dutta? --[[User:Closed Limelike Curves|Closed Limelike Curves]] ([[User talk:Closed Limelike Curves|talk]]) 19:29, 21 February 2024 (UTC)
: [[Independence of covered alternatives]] (IoCA; Landau-independence) is unfortunately incompatible with monotonicity. [[River]] passes a criterion somewhere between ISDA and IoCA called "independence of strongly dominated alternatives". That criterion also implies IPDA. So there might be some space between strongly dominated and IoCA that would still give you monotonicity, but I don't know what it would be.
: 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)
| |||