Defeat-dropping Condorcet methods: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 1:
[[Category:Condorcet methods]]
The overarching goal of defeat-droppers is to elect a candidate who is "closest" to being a [[Condorcet winner]] i.e. to minimize the number of "overruled" voters. Defeat-droppers are some of the only Condorcet methods that only require the [[Pairwise comparison matrix|pairwise comparison matrix]] to find the results.
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).
| |||