Minimax Condorcet method: Difference between revisions

Rewrote the defeat-dropper note to clarify how they fail DMTBR.
(Bolded the bad-example so it's clear where the ballots were truncated.)
(Rewrote the defeat-dropper note to clarify how they fail DMTBR.)
 
(One intermediate revision by one other user not shown)
Line 65:
This contrasts with [[Schulze]], which alternates between eliminating all candidates not in the [[Schwartz set]] and dropping defeats.
 
All [[:Category:Defeat-dropping Condorcet methods|defeat-dropping Condorcet methods]] become equivalent to Minimax whenwith there are 3three or fewer candidates with no pairwise ties between them. Because of this, defeat-droppersdropping methods that pass [[ISDA]] are equivalent to [[Smith//Minimax]] when the abovecycle conditionsinvolves holdonly for3 the Smith setcandidates. Example:
 
Since the defeat-droppers are equivalent to either Minmax or Smith//MinmaxMinimax when three or fewer candidates run, they all fail [[dominant mutual third burial resistance]]. This follows from the equivalence and the three-candidate Minimax DMTBR failure example given above.
{{ballots|
25: A>B>C
40: B>C>A
35: C>A>B
}}
 
The pairwise victories are 60 A>B, 65 B>C, 75 C>A. The A>B defeat is weakest by winning votes, so dropping it results in B being undefeated (alternatively, B's win can be explained as them being on the losing end of this defeat, and this defeat being their strongest defeat, since it's their only defeat).
 
Since the defeat-droppers are equivalent to either Minmax or Smith//Minmax when three or fewer candidates run, they all fail dominant mutual third burial resistance.
 
== References ==
1,202

edits