• Thumbnail for Condorcet method
    A Condorcet method (English: /kɒndɔːrˈseɪ/; French: [kɔ̃dɔʁsɛ]) is an election method that elects the candidate who wins a majority of the vote in every...
    71 KB (9,462 words) - 10:49, 14 February 2025
  • Thumbnail for Schulze method
    voting rule developed by Markus Schulze. The Schulze method is a Condorcet completion method, which means it will elect a majority-preferred candidate if...
    50 KB (4,262 words) - 13:34, 17 March 2025
  • Thumbnail for Condorcet winner criterion
    A Condorcet winner (French: [kɔ̃dɔʁsɛ], English: /kɒndɔːrˈseɪ/) is a candidate who would receive the support of more than half of the electorate in a...
    18 KB (2,303 words) - 23:42, 28 February 2025
  • Thumbnail for Minimax Condorcet method
    systems, the Minimax Condorcet method is a single-winner ranked-choice voting method that always elects the majority (Condorcet) winner. Minimax compares...
    13 KB (1,159 words) - 08:26, 22 May 2024
  • Thumbnail for Kemeny–Young method
    election. It is a Condorcet method because if there is a Condorcet winner, it will always be ranked as the most popular choice. This method assigns a score...
    28 KB (2,900 words) - 19:06, 23 March 2025
  • Thumbnail for Condorcet paradox
    minimizing the rate of such self-contradictions, are called Condorcet methods. Condorcet's paradox is a special case of Arrow's paradox, which shows that...
    25 KB (3,468 words) - 10:32, 28 March 2025
  • Thumbnail for Copeland's method
    the most victories overall. Copeland's method has the advantage of being likely the simplest Condorcet method to explain and of being easy to administer...
    18 KB (2,491 words) - 15:05, 17 July 2024
  • Thumbnail for Ranked voting
    developed what would later be known as Copeland's method, which is similar to Condorcet's method. Copeland's method was devised by Ramon Llull in his 1299 treatise...
    27 KB (3,323 words) - 19:26, 28 April 2025
  • Thumbnail for Marquis de Condorcet
    Marie Jean Antoine Nicolas de Caritat, Marquis of Condorcet (/kɒndɔːrˈseɪ/; French: [maʁi ʒɑ̃ ɑ̃twan nikɔla də kaʁita maʁki də kɔ̃dɔʁsɛ]; 17 September...
    53 KB (5,733 words) - 10:27, 30 March 2025
  • Thumbnail for Smith set
    Smith set, sometimes called the top-cycle or Condorcet winning set, generalizes the idea of a Condorcet winner to cases where no such winner exists. It...
    17 KB (2,324 words) - 07:30, 24 February 2025
  • Thumbnail for Tideman alternative method
    a single winner using ranked ballots. This method is Smith-efficient, making it a kind of Condorcet method, and uses the alternative vote (RCV) to resolve...
    4 KB (441 words) - 19:32, 24 December 2024
  • the Condorcet winner criterion. A voting system complying with the Condorcet loser criterion will never allow a Condorcet loser to win. A Condorcet loser...
    11 KB (1,094 words) - 06:58, 24 February 2025
  • Thumbnail for First-past-the-post voting
    city. This makes the election a center squeeze. By contrast, both Condorcet methods and score voting would return Nashville (the capital of Tennessee)...
    72 KB (7,262 words) - 22:46, 13 April 2025
  • Thumbnail for Majority winner criterion
    of voters, that candidate must win. Some methods that comply with this criterion include any Condorcet method, instant-runoff voting, Bucklin voting, plurality...
    8 KB (1,085 words) - 15:35, 14 March 2025
  • Thumbnail for Electoral system
    runoff systems are not called majority voting, as this term refers to Condorcet-methods. There are two main groups of runoff systems, those in one group use...
    57 KB (7,248 words) - 21:13, 25 April 2025
  • Thumbnail for Nanson's method
    methods that are called Nanson method and Baldwin method (also called Total Vote Runoff or TVR). Both methods are designed to satisfy the Condorcet criterion...
    10 KB (1,212 words) - 17:08, 24 February 2025
  • Thumbnail for Ranked pairs
    Ranked pairs (redirect from Tideman method)
    ranked-pairs procedure complies with the Condorcet winner criterion (and as a result is considered to be a Condorcet method). Ranked pairs begins with a round-robin...
    9 KB (970 words) - 11:39, 14 February 2025
  • Thumbnail for Spoiler effect
    affected by center-squeeze and vote splitting. Majority-rule (or Condorcet) methods are only rarely affected by spoilers, which are limited to rare situations...
    48 KB (4,987 words) - 05:34, 30 April 2025
  • Thumbnail for Participation criterion
    are at most 3 major candidates, Minimax Condorcet and its variants (such as ranked pairs and Schulze's method) satisfy the participation criterion. However...
    26 KB (2,598 words) - 07:29, 4 April 2025
  • Thumbnail for Sainte-Laguë method
    The Webster method, also called the Sainte-Laguë method (French pronunciation: [sɛ̃t.la.ɡy]), is a highest averages apportionment method for allocating...
    27 KB (2,991 words) - 10:52, 3 April 2025
  • Thumbnail for Dodgson's method
    winner; if no such winner is found, the method proceeds by finding the candidate who could be transformed into a Condorcet winner with the smallest number of...
    3 KB (344 words) - 16:46, 21 October 2024
  • Thumbnail for Negative responsiveness
    system. Some quota-based apportionment methods also violate the rule, as can the randomized Condorcet method in cases of cyclic ties. The participation...
    21 KB (2,182 words) - 00:20, 22 April 2025
  • Thumbnail for Comparison of voting rules
    Condorcet method will converge on a single Condorcet winner, who will have the highest probability of being the best candidate. However, Condorcet's model...
    44 KB (4,518 words) - 13:24, 28 February 2025
  • Thumbnail for Coombs' method
    last by the most voters is eliminated. The method fails most voting system criteria, including Condorcet's majority criterion, monotonicity, participation...
    7 KB (826 words) - 07:02, 2 March 2025
  • Thumbnail for Arrow's impossibility theorem
    situations where they are not forced. By contrast, majority-rule (Condorcet) methods of ranked voting uniquely minimize the number of spoiled elections...
    60 KB (5,573 words) - 00:37, 19 February 2025
  • Thumbnail for Instant-runoff voting
    elect a Condorcet winner is positive, as it enables instant-runoff voting to pass later-no-help and later-no-harm, which together render the method immune...
    83 KB (9,100 words) - 22:36, 29 April 2025
  • Thumbnail for Black's method
    Black's method is an election method proposed by Duncan Black in 1958 as a compromise between the Condorcet method and the Borda count. This method selects...
    3 KB (224 words) - 17:54, 6 September 2024
  • Thumbnail for Quota method
    highest averages methods (also called divisor methods). By far the most common quota method are the largest remainders or quota-shift methods, which assign...
    12 KB (1,404 words) - 20:09, 31 March 2025
  • Thumbnail for Median voter theorem
    all Condorcet methods possess the median voter property in one dimension. It turns out that Condorcet methods are not unique in this: Coombs' method is...
    32 KB (3,936 words) - 03:31, 17 February 2025
  • election of a Condorcet winners (when one exists) include Ranked Pairs, Schulze's method, and the Tideman alternative method. Methods that do not guarantee...
    4 KB (5,970 words) - 08:22, 26 February 2025