4,193
edits
Condorcet method: Difference between revisions
Noting that many aggregate methods are also Condorcet methods
(Clarifying the first few sentences of this article.) |
(Noting that many aggregate methods are also Condorcet methods) |
||
Line 1:
{{Wikipedia}}
A '''Condorcet method''' is any election method (or [[aggregate method]]) conforming to the [[Condorcet winner criterion]]. The method in question must always elects the "beats-all" winner, selecting any candidate who can beat any other candidate in a pairwise runoff. The name ("Condorcet method") comes from the 18th century mathematician and philosopher [[Marquis de Condorcet]], although the method was previously described by [[Ramon Llull]] in the 13th century. Many Condorcet advocates agree that a further criterion that Condorcet methods should pass is the [[Smith criterion]], which means the Condorcet method will always elect someone from the [[Smith set]] when there is no beats-all winner (usually due to the [[Condorcet paradox]]).
'''Condorcet''' is sometimes used to refer to the family of Condorcet methods as a whole.
Line 374:
[[Category:Condorcet methods]]
[[Category:Aggregate methods]]
==References==
| |||