Defeat-dropping Condorcet methods: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 3:
These are [[Condorcet methods]] which reduce to [[Minimax]] in situations when there are 3 or fewer candidates (except possibly if there are any pairwise ties). Defeat-dropping Condorcet methods that pass [[Independence of Smith-dominated Alternatives]] are equivalent to [[Smith//Minimax]] with a [[Smith set]] of 3 or fewer candidates (except possibly if there are pairwise ties).
Many defeat-droppers are [[Smith-efficient]] simply because candidates in the Smith set have no defeats to be dropped against candidates not in the Smith set.
| |||