Borda count
E188679
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.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Borda count canonical | 1 |
| Borda rule | 1 |
| Borda voting | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1660437 — 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: Borda count Context triple: [Single Transferable Vote, contrastsWith, Borda count]
-
A.
Single Transferable Vote
Single Transferable Vote is a proportional representation electoral system in which voters rank candidates by preference and seats are allocated by transferring votes according to these rankings.
-
B.
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.
-
C.
ThreeBallot voting system
The ThreeBallot voting system is an end-to-end auditable voting scheme proposed by cryptographer Ronald L. Rivest that aims to provide voter verifiability and privacy without relying on complex cryptographic mechanisms.
-
D.
Arrow’s impossibility theorem
Arrow’s impossibility theorem is a foundational result in social choice theory showing that no voting system can convert individual preferences into a collective ranking while simultaneously satisfying a set of seemingly reasonable fairness criteria.
-
E.
congressional district method
The congressional district method is a system for allocating Electoral College votes in which one elector is awarded to the winner of each congressional district and the remaining two electors go to the statewide popular vote winner.
- 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: Borda count Target entity description: 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.
-
A.
Single Transferable Vote
Single Transferable Vote is a proportional representation electoral system in which voters rank candidates by preference and seats are allocated by transferring votes according to these rankings.
-
B.
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.
-
C.
ThreeBallot voting system
The ThreeBallot voting system is an end-to-end auditable voting scheme proposed by cryptographer Ronald L. Rivest that aims to provide voter verifiability and privacy without relying on complex cryptographic mechanisms.
-
D.
Arrow’s impossibility theorem
Arrow’s impossibility theorem is a foundational result in social choice theory showing that no voting system can convert individual preferences into a collective ranking while simultaneously satisfying a set of seemingly reasonable fairness criteria.
-
E.
congressional district method
The congressional district method is a system for allocating Electoral College votes in which one elector is awarded to the winner of each congressional district and the remaining two electors go to the statewide popular vote winner.
- F. None of above. chosen
Statements (51)
| Predicate | Object |
|---|---|
| instanceOf |
positional voting method
ⓘ
ranked voting method ⓘ single-winner voting system ⓘ social choice rule ⓘ |
| aggregationType | preference aggregation method ⓘ |
| alsoKnownAs |
Borda count
ⓘ
surface form:
Borda rule
Borda count ⓘ
surface form:
Borda voting
|
| axiomatizedBy |
Young’s characterization using neutrality, anonymity, reinforcement, and continuity
ⓘ
various scoring-rule axiomatizations in social choice theory ⓘ |
| canElect | Condorcet loser in some profiles ⓘ |
| canFail | majority criterion ⓘ |
| computationalComplexity | winner determination is polynomial time ⓘ |
| decisionRule | candidate with highest total Borda score wins ⓘ |
| domain |
collective decision-making
ⓘ
social choice theory ⓘ voting theory ⓘ |
| generalizationOf |
anti-plurality rule as special case of scoring vectors
ⓘ
plurality rule as special case of scoring vectors ⓘ |
| inventedBy | Jean-Charles de Borda ⓘ |
| namedAfter | Jean-Charles de Borda ⓘ |
| originalContext |
Académie des Sciences
ⓘ
surface form:
French Academy of Sciences elections
|
| outputType | single winning candidate ⓘ |
| proposedInYear | 1770 ⓘ |
| publishedInYear | 1781 ⓘ |
| relatedTo |
Condorcet criterion
ⓘ
surface form:
Condorcet method
Kemeny–Young method ⓘ approval voting ⓘ plurality voting ⓘ positional scoring rules ⓘ |
| satisfiesProperty |
Pareto efficiency
ⓘ
anonymity among voters ⓘ consistency with majority judgment in some settings ⓘ continuity ⓘ neutrality among candidates ⓘ reinforcement (under some formulations) ⓘ |
| scoreAssignment | points assigned to candidates based on their position in each ranking ⓘ |
| strategicVulnerability |
susceptible to burying strategy
ⓘ
susceptible to compromising strategy ⓘ susceptible to tactical voting ⓘ |
| susceptibleTo | cloning of candidates ⓘ |
| typicalScoringVector | for n candidates, top rank gets n-1 points, next gets n-2, down to 0 ⓘ |
| usedIn |
some academic society elections
ⓘ
some political party internal elections ⓘ some recommendation and ranking systems ⓘ some sports awards voting ⓘ |
| usesBallotType | ranked ballot ⓘ |
| usesInformation | full ranking information from each voter ⓘ |
| usesInput | complete ranking of candidates by each voter ⓘ |
| violatesProperty |
Condorcet criterion
ⓘ
independence of irrelevant alternatives ⓘ monotonicity in some variants with truncation or ties ⓘ |
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: Borda count Description of subject: 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.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Borda rule
this entity surface form:
Borda voting