Information for "Condorcet method"

Basic information

Display titleCondorcet method
Default sort keyCondorcet method
Page length (in bytes)36,014
Page ID96
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page6
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>WikipediaBot
Date of page creation20:00, 26 January 2005
Latest editorRobLa (talk | contribs)
Date of latest edit04:51, 4 May 2022
Total number of edits73
Total number of distinct authors21
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (14)

Templates used on this page:

Page transcluded on (1)

Template used on this page:

SEO properties

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).
Information from Extension:WikiSEO