Condorcet winner criterion: Difference between revisions
Cleaned up the initial paragraph a bit.
m (Fixed typo) |
(Cleaned up the initial paragraph a bit.) |
||
Line 1:
{{Wikipedia}}<!-- {{cleanup|date=February 2020}} -->
An [[electoral system]] satisfies the "'''Condorcet winner criterion"''', also known as the '''Condorcet criterion''', if it always chooses the Condorcet winner when one exists. The "Condorcet
The '''Condorcet winner criterion''' for a [[voting system]] is that it chooses the beats-all winner when one exists. Any method conforming to the Condorcet criterion is known as a [[Condorcet method]].
Mainly because of [[Condorcet paradox|Condorcet's voting paradox]], a beats-all winner will not always exist in a given set of votes. However, there will always be a smallest group of candidates such that more voters prefer anyone in the group over anyone outside of the group. If the beats-all winner exists, they will be the only candidate in this group, which is called the [[Smith set]]. Voting methods that always elect from the Smith set are known as "[[Smith-efficient]]".
|