Sequential dropping: Difference between revisions
Content added Content deleted
Psephomancy (talk | contribs) (Category:Condorcet method → Category:Condorcet methods) |
No edit summary |
||
Line 3:
Differs from minmax only in the "that's in a cycle" proviso. As a result of that proviso, sequential dropping is Smith-efficient. Unlike [[Schulze method|Schulze]], [[ranked pairs]], and [[river]], sequential dropping fails monotonicity and clone independence.
[[Category:Smith-efficient Condorcet methods]]
| |||
Revision as of 06:04, 22 February 2020
Drop the weakest pairwise defeat that's in a cycle until a candidate is unbeaten.
Differs from minmax only in the "that's in a cycle" proviso. As a result of that proviso, sequential dropping is Smith-efficient. Unlike Schulze, ranked pairs, and river, sequential dropping fails monotonicity and clone independence.