| Display title | Condorcet method |
| Default sort key | Condorcet method |
| Page length (in bytes) | 36,014 |
| Page ID | 96 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 6 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>WikipediaBot |
| Date of page creation | 20:00, 26 January 2005 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 04:51, 4 May 2022 |
| Total number of edits | 73 |
| Total number of distinct authors | 21 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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). |
