Minimax Condorcet method: Difference between revisions
Content added Content deleted
(→Notes) |
(Rewrote the defeat-dropper note to clarify how they fail DMTBR.) |
||
Line 65: | Line 65: | ||
This contrasts with [[Schulze]], which alternates between eliminating all candidates not in the [[Schwartz set]] and dropping defeats. |
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 |
All [[:Category:Defeat-dropping Condorcet methods|defeat-dropping Condorcet methods]] become equivalent to Minimax with three or fewer candidates. Because of this, defeat-dropping methods that pass [[ISDA]] are equivalent to [[Smith//Minimax]] when the cycle involves only 3 candidates. |
||
⚫ | |||
{{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). |
|||
⚫ | |||
== References == |
== References == |