Defeat-dropping Condorcet methods: Difference between revisions

Content added Content deleted

Inline

Revision as of 08:41, 20 March 2020 (view source) BetterVotingAdvocacy (talk \| contribs) No edit summary Tag: Visual edit ← Older edit		Revision as of 08:35, 23 March 2020 (view source) BetterVotingAdvocacy (talk \| contribs) No edit summary Tag: Visual edit Newer edit →
Line 3:		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).		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.