Defeat-dropping Condorcet methods: Difference between revisions

Content added Content deleted

Inline

Revision as of 19:41, 21 February 2020

These are Condorcet methods which, in the event of a cycle, can all be considered generalizations of Minimax to situations where there are more than 3 candidates in the Smith set.

Revision as of 17:08, 21 February 2020 (view source) BetterVotingAdvocacy (talk \| contribs) No edit summary Tag: Visual edit ← Older edit		Revision as of 19:41, 21 February 2020 (view source) BetterVotingAdvocacy (talk \| contribs) No edit summary Tag: Visual edit Newer edit →
Line 1:		Line 1:
	[[Category:Condorcet methods]]		[[Category:Condorcet methods]]
	These are [[Condorcet methods]] which, in the event of a [[Condorcet cycle\|cycle]], rank all candidates' [[Pairwise counting\|pairwise defeats]] in some order, and then ignore as few of the first pairwise defeats in the order as necessary to find a candidate who is a [[Condorcet winner]] based on their non-ignored pairwise matchups. They can all be considered generalizations of [[Minimax]] to situations where there are more than 3 candidates in the [[Smith set]].		These are [[Condorcet methods]] which, in the event of a [[Condorcet cycle\|cycle]], can all be considered generalizations of [[Minimax]] to situations where there are more than 3 candidates in the [[Smith set]].