Below you will find example sentences with "condorcet winner". The examples show how this phrase is used in natural context and which words often surround it.
Condorcet Winner in a sentence
Corpus data
- Displayed example sentences: 20
- Discovered as a combination around: winner
- Corpus frequency in the collocation scan: 7
- Phrase length: 2 words
- Average sentence length: 24.6 words
Sentence profile
- Phrase position: 3 start, 10 middle, 7 end
- Sentence types: 20 statements, 0 questions, 0 exclamations
Corpus analysis
- The phrase "condorcet winner" has 2 words and usually appears in the middle in these examples. The average sentence has 24.6 words and is mostly made up of statements.
- Around this phrase, patterns and context words such as a condorcet winner doesn t, also the condorcet winner, candidate, methods and method stand out.
- In the phrase index, this combination connects with game winner, award winner, trophy winner, game winner and cup winner, linking the page to nearby combinations.
Example types with condorcet winner
This selection groups the examples by length and sentence type, making usage of the full phrase easier to scan:
In certain circumstances an election has no Condorcet winner. (9 words)
In this scenario, the winner is also the Condorcet winner. (10 words)
A candidate with that property is called a Condorcet winner. (10 words)
Two-method systems One family of Condorcet methods consists of systems that first conduct a series of pairwise comparisons and then, if there is no Condorcet winner, fall back to an entirely different, non-Condorcet method to determine a winner. (40 words)
Advocates of Condorcet methods argue that a candidate can claim to have majority support only if they are the "Condorcet winner" that is, the candidate who would beat every other candidate in a series of one-on-one elections. (39 words)
A Condorcet winner doesn't always exist because majority preferences can be like rock-paper-scissors : for each candidate, there can be another that is preferred by some majority (this is known as Condorcet paradox ). (35 words)
Example sentences (20)
Two-method systems One family of Condorcet methods consists of systems that first conduct a series of pairwise comparisons and then, if there is no Condorcet winner, fall back to an entirely different, non-Condorcet method to determine a winner.
Other Condorcet methods involve an entirely different system of counting, but are classified as Condorcet methods because they will still elect the Condorcet winner if there is one.
In cases where there is a Condorcet Winner, and where IRV does not choose it, a majority would by definition prefer the Condorcet Winner to the IRV winner.
As noted above, if there is no Condorcet winner a further method must be used to find the winner of the election, and this mechanism varies from one Condorcet method to another.
A Condorcet winner doesn't always exist because majority preferences can be like rock-paper-scissors : for each candidate, there can be another that is preferred by some majority (this is known as Condorcet paradox ).
Advocates of Condorcet methods argue that a candidate can claim to have majority support only if they are the "Condorcet winner" that is, the candidate who would beat every other candidate in a series of one-on-one elections.
A voting system that always elects the Condorcet winner when there is one is described by electoral scientists as a system that satisfies the Condorcet criterion.
Because all Condorcet methods always choose the Condorcet winner when one exists, the difference between methods only appears when cyclic ambiguity resolution is required.
Definition A Condorcet method is a voting system that will always elect the Condorcet winner; this is the candidate whom voters prefer to each other candidate, when compared to them one at a time.
The methods that will—the Condorcet methods—can elect different winners when no candidate is a Condorcet winner.
With threshold voting, it is still possible to not elect the Condorcet winner and instead elect the Condorcet loser when they both exist.
But this method cannot reveal a voting paradox in which there is no Condorcet winner and a majority prefer an early loser over the eventual winner.
In this scenario, the winner is also the Condorcet winner.
There are many ways that the votes can be tallied to find a winner, and not all will elect the Condorcet winner whenever one exists.
A candidate with that property is called a Condorcet winner.
Circular ambiguities As noted above, sometimes an election has no Condorcet winner because there is no candidate who is preferred by voters to all other candidates.
Example with the Schulze method : * B is the sincere Condorcet winner.
In certain circumstances an election has no Condorcet winner.
In the sum matrix above, A is the Condorcet winner because A beats every other candidate.
Sets used for this purpose are defined so that they will always contain only the Condorcet winner if there is one, and will always, in any case, contain at least one candidate.