Sequential dropping

From Electowiki
Revision as of 17:33, 3 December 2005 by MarkusSchulze (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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.