Sequential dropping: Difference between revisions
Content added Content deleted
imported>KVenzke m (cat) |
imported>MarkusSchulze No edit summary |
||
| Line 1: | Line 1: | ||
'''Drop the weakest pairwise defeat ''that's in a cycle'' until a candidate is unbeaten.''' |
'''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 [[ |
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:Condorcet method]] |
[[Category:Condorcet method]] |
||
Revision as of 01:33, 4 December 2005
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.