Minimax Condorcet method: Difference between revisions
→Notes
No edit summary |
(→Notes) |
||
Line 29:
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 when there are 3 or fewer candidates with no pairwise ties between them. Because of this, defeat-droppers that pass [[ISDA]] are equivalent to [[Smith//Minimax]] when the above conditions hold for the Smith set. Example:
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).
[[Category:Single-winner voting methods]]
| |||