Condorcet method
E1427387
UNEXPLORED
The Condorcet method is a family of voting systems in which the winner is the candidate who would defeat every other candidate in head-to-head majority contests.
All labels observed (6)
| Label | Occurrences |
|---|---|
| Condorcet method canonical | 6 |
| Condorcet winner | 2 |
| Condorcet method with Cloneproof Schwartz Sequential Dropping | 1 |
| Condorcet voting | 1 |
| Minimax Condorcet method | 1 |
| Ranked Pairs | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T20364043 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Condorcet method Context triple: [social choice theory, hasKeyConcept, Condorcet method]
-
A.
Borda count
The Borda count is a ranked voting method in which voters order candidates and points are assigned based on position in each ranking, with the candidate having the highest total score winning.
-
B.
Condorcet criterion
The Condorcet criterion is a voting system standard requiring that if a candidate would win every head-to-head contest against each other candidate, that candidate must be the overall election winner.
-
C.
Kemeny–Young method
The Kemeny–Young method is a voting system that ranks candidates by finding the ordering that best reflects voters’ pairwise preferences, minimizing overall disagreement.
-
D.
Condorcet paradox
The Condorcet paradox is a voting theory phenomenon where collective preferences can become cyclic and inconsistent, even when individual voters’ preferences are perfectly rational and transitive.
-
E.
Sainte-Laguë method
The Sainte-Laguë method is a highest-averages system of party-list proportional representation that allocates seats more evenly between large and small parties than the d’Hondt method.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Condorcet method Target entity description: The Condorcet method is a family of voting systems in which the winner is the candidate who would defeat every other candidate in head-to-head majority contests.
-
A.
Borda count
The Borda count is a ranked voting method in which voters order candidates and points are assigned based on position in each ranking, with the candidate having the highest total score winning.
-
B.
Condorcet criterion
The Condorcet criterion is a voting system standard requiring that if a candidate would win every head-to-head contest against each other candidate, that candidate must be the overall election winner.
-
C.
Kemeny–Young method
The Kemeny–Young method is a voting system that ranks candidates by finding the ordering that best reflects voters’ pairwise preferences, minimizing overall disagreement.
-
D.
Condorcet paradox
The Condorcet paradox is a voting theory phenomenon where collective preferences can become cyclic and inconsistent, even when individual voters’ preferences are perfectly rational and transitive.
-
E.
Sainte-Laguë method
The Sainte-Laguë method is a highest-averages system of party-list proportional representation that allocates seats more evenly between large and small parties than the d’Hondt method.
- F. None of above. chosen
Referenced by (12)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Condorcet method
linked to: Condorcet method
linked to: Condorcet method
linked to: Condorcet method
subject linked to:
General Resolution
Amendment of the Constitution
→
uses
→
Condorcet method with Cloneproof Schwartz Sequential Dropping
ⓘ
linked to: Condorcet method
linked to: Condorcet method