Anonymous user
Sequential dropping: Difference between revisions
m
cat
imported>James Green-Armytage (create) |
imported>KVenzke m (cat) |
||
Line 2:
Differs from minmax only in the "that's in a cycle" proviso. As a result of that proviso, sequential dropping is Smith-efficient. Unlike [[beatpath]], [[ranked pairs]], and [[river]], sequential dropping fails monotonicity and clone independence.
[[Category:Condorcet method]]
| |||