Defeat-dropping Condorcet methods: Difference between revisions

Content added Content deleted

Inline

Revision as of 08:41, 20 March 2020

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.

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).

@@ Line 1: / 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.
-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.
+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).