Defeat-dropping Condorcet methods: Difference between revisions
Defeat-dropping Condorcet methods (view source)
Revision as of 18:53, 27 February 2020
, 4 years agono edit summary
No edit summary |
No edit summary |
||
Line 1:
[[Category:Condorcet methods]]
These are [[Condorcet methods]] which only differ from [[Minimax]] in situations where there are more than 3 candidates, or pairwise ties when there are 3 or fewer candidates. 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 with no pairwise ties between them.
| |||