Sequential dropping: Difference between revisions

Sequential dropping (view source)

68 bytes added , 4 years ago

no edit summary

1,895

edits

Revision as of 01:33, 4 December 2005 (view source) imported>MarkusSchulze No edit summary ← Older edit		Latest revision as of 11:18, 22 April 2020 (view source) BetterVotingAdvocacy (talk \| contribs) No edit summary Tag: Visual edit
(2 intermediate revisions by 2 users 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 ~~method~~methods]] [[Category:Defeat-dropping Condorcet methods]]