4,193
edits
Condorcet method: Difference between revisions
m
Inserting newlines around the Template:Image frame in hopes that the diff is more readable. It doesn't appear that I was successful, but oh well.
m (Inserting newlines around the Template:Image frame in hopes that the diff is more readable. It doesn't appear that I was successful, but oh well.) |
|||
Line 1:
{{Wikipedia}}
{{Wikipedia}}{{Image frame|width=500|content=Suppose the voters had been polled on their preferences among the candidates, and the following preferences in head-to-head matchups are produced between French Fries (FF), Hamburger (H), and Cookies (C) ▼
▲
(FF>C shows the number of voters who prefer FF over C, for example):
Line 21 ⟶ 23:
FF (French Fries) is the CW here.
|caption=Example of finding the Condorcet winner|border=|max-width=}}
|caption=Example of finding the Condorcet winner|border=|max-width=}}Any election method conforming to the [[Condorcet criterion]] - that is, one which always elects the [[beats-all winner]], a candidate who can beat any other candidate in a runoff, if one exists - is known as a '''Condorcet method'''. The name 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.
| |||