Condorcet Ranking Methods
Some Condorcet methods produce not just a single winner, but a ranking of all candidates from first to last place. A Condorcet ranking is a list of candidates with the property that the Condorcet winner (if one exists) comes first and the Condorcet loser (if one exists) comes last, and this holds recursively for the candidates ranked between them.
Methods that satisfy this property include:
- Copeland's method
- Kemeny-Young method
- Ranked Pairs
- Schulze method
Read more about this topic: Condorcet Method
Famous quotes containing the words ranking and/or methods:
“We should spend less time ranking children and more time helping them to identify their natural competencies and gifts and cultivate these. There are hundreds and hundreds of ways to succeed and many, many different abilities that will help you get there.”
—Howard Gardner (20th century)
“The greatest part of our faults are more excusable than the methods that are commonly taken to conceal them.”
—François, Duc De La Rochefoucauld (1613–1680)