Kemeny–Young method
E719672
The Kemeny–Young method is a voting system that ranks candidates by finding the ordering that best reflects voters’ pairwise preferences, minimizing overall disagreement.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Kemeny–Young method canonical | 2 |
| Kemeny rule | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T8083779 — 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: Kemeny–Young method Context triple: [Borda count, relatedTo, Kemeny–Young 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.
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.
-
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.
d’Hondt method
The d’Hondt method is a highest-averages formula used in proportional representation systems to allocate seats or posts among parties based on their share of the vote.
- 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: Kemeny–Young method Target entity description: The Kemeny–Young method is a voting system that ranks candidates by finding the ordering that best reflects voters’ pairwise preferences, minimizing overall disagreement.
-
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.
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.
-
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.
d’Hondt method
The d’Hondt method is a highest-averages formula used in proportional representation systems to allocate seats or posts among parties based on their share of the vote.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
Condorcet method
ⓘ
ranked voting method ⓘ voting system ⓘ |
| aggregationType | distance-based voting rule ⓘ |
| alsoKnownAs |
Kemeny optimal aggregation
ⓘ
linked to:
Rank aggregation problem
Kemeny rule ⓘ
linked to:
Kemeny–Young method
|
| appliedIn |
computational social choice
ⓘ
information retrieval rank aggregation ⓘ meta-search engine result aggregation ⓘ preference aggregation ⓘ rank aggregation ⓘ social choice theory ⓘ |
| assumes | complete and transitive social ranking of candidates ⓘ |
| basedOn |
Kendall tau distance
ⓘ
linked to:
Kendall rank correlation coefficient
pairwise majority margins ⓘ |
| computationalComplexity | NP-hard to compute exactly for many candidates ⓘ |
| computationalProblem |
Kemeny score computation is NP-hard
ⓘ
winner determination is NP-hard ⓘ |
| definition | selects rankings that maximize total agreement with voters’ pairwise preferences ⓘ |
| equivalentTo | maximum likelihood estimator under certain noise models ⓘ |
| formalizedAs | optimization problem over permutations ⓘ |
| goal |
minimize disagreement with voters’ preferences
ⓘ
produce a complete ranking of candidates ⓘ |
| input | set of voters’ strict preference rankings over candidates ⓘ |
| introducedInField | social choice theory ⓘ |
| minimizes | sum of pairwise disagreements between ranking and ballots ⓘ |
| namedAfter |
H. Peyton Young
ⓘ
John G. Kemeny ⓘ |
| output | a linear order of candidates ⓘ |
| property |
Condorcet-consistent ranking extension
ⓘ
can produce ties between rankings with equal Kemeny score ⓘ |
| relatedConcept |
Borda count
ⓘ
Kendall tau correlation ⓘ Rank aggregation problem ⓘ Schulze method ⓘ |
| satisfies |
Condorcet criterion
ⓘ
Pareto efficiency ⓘ anonymity ⓘ majority criterion (for winner selection) ⓘ neutrality ⓘ reinforcement (under some formulations) ⓘ unrestricted domain (universal domain) ⓘ |
| uses |
Kemeny score to evaluate rankings
ⓘ
pairwise preference comparisons ⓘ |
| violates |
independence of irrelevant alternatives
ⓘ
monotonicity (in some profiles) ⓘ participation criterion ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Kemeny–Young method Description of subject: The Kemeny–Young method is a voting system that ranks candidates by finding the ordering that best reflects voters’ pairwise preferences, minimizing overall disagreement.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Kemeny–Young method