Sequential dropping: Difference between revisions
no edit summary
Psephomancy (talk | contribs) (Category:Condorcet method → Category:Condorcet methods) |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
Line 1:
'''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 method|Schulze]], [[ranked pairs]], and [[river]], sequential dropping fails monotonicity and clone independence.
[[Category:Smith-efficient Condorcet methods]]
[[Category:Defeat-dropping Condorcet methods]]
| |||