Methods · Aggregation and voting
Borda Count
The Borda count awards every alternative a score based on its position in a set of rank lists, then ranks the alternatives by the sum of these scores.
Base method's data type: Classical
What Is the Method?
The Borda count is an aggregation and voting method that turns several rank lists (several experts' opinions, several jury members, or the ranks several sub-methods produce) into a single combined rank. Every rank list awards a score based on the position an alternative holds in it: coming last is worth 0 points, each step up adds 1 point; coming first earns the highest score. An alternative's final Borda score is the sum of the scores it receives across all lists. Its output is a score, and a rank based on that score. Proposed by the French mathematician Jean-Charles de Borda in 1781 for election boards, it is one of the best-known positional voting rules.
The Philosophy Behind It
The idea behind the Borda count is to look not only at "who came first" but at every alternative's position across all the lists. If a voting rule counts only first preferences (as majority rule does), how often an alternative is preferred second or third remains invisible. Borda folds this information into the score too: an alternative widely seen as "second best" can overtake one with narrow but strong first-preference support. The philosophical consequence is that the Borda count is compensatory and consensus-seeking; it rewards broad acceptance across the lists rather than sharp first preferences.
How It Works
The method proceeds through three steps.
First, gather the rank lists. K rank lists (experts, jury members or sub-methods) are gathered, each assigning a rank number (1 = best) to m alternatives.
Second, score. Every alternative's score on every list is found by subtracting its rank on that list from the total number of alternatives; coming last earns 0 points, coming first earns m minus 1 points. An alternative's final Borda score is the sum of these scores across all lists.
Third, rank. Alternatives are arranged from the highest Borda score to the lowest; the alternative with the highest score comes first.
The formula behind each step and the intermediate tables are given on the DecisionMind method page; this card carries no formulas.
How to Read the Output
The Borda score shows how broadly an alternative is accepted across the lists; on its own it does not answer "how many people ranked it first." A high Borda score means the alternative was never ranked very poorly on any list and sat near the top on most lists; it does not mean the alternative was the most-preferred first choice. An important feature of the Borda count is this: adding or removing an alternative from the set can change the relative order of the remaining alternatives, because the scores depend on the number of alternatives (m).
Thus instead of writing:
"The alternative with the highest Borda score is the most-preferred first choice"
the report should read:
"The alternative with the highest Borda score is the one most broadly accepted across the lists; this may not be the same as the most-preferred first choice"
Data Type and Inputs
The Borda count works with crisp data, and its input is a rank matrix: alternatives in the rows, rank lists (experts, jury members or sub-methods) in the columns, and every cell holding an integer rank from 1 to m, not a raw score. DecisionMind currently holds no fuzzy or other-data-type extension of this method; it works only in its base form. You must ensure every list ranks all alternatives completely; an incomplete ranking distorts the scores. At least two alternatives and two rank lists are required; three to twelve rank lists work comfortably. The method neither produces weights nor requires them; its input is rank numbers directly.
When to Use It, When Not To
The Borda count is suitable when you have several rank lists and your goal is a combined rank that reflects broad acceptance across the lists, not just first preferences; it is used often in voting, jury assessment, and decision processes with several sub-methods. In a setting where the set of alternatives could change during the analysis (a new alternative might be added later), the Borda count becomes risky, because that addition can change the order of the remaining alternatives. If you only want to find "the most-preferred first choice," the Borda count is unsuitable; simple majority counting is sufficient in that case.
Several rank lists exist, a combined rank reflecting broad acceptance is needed → Borda Count
Same rank lists, but combining by mean position alone is wanted → Mean Rank
Only the most-preferred first-choice alternative is sought → simple majority count
The set of alternatives could change during the analysis → interpret the result with caution, fix the set before the analysis
Strengths
The Borda count's greatest advantage is that it uses the full rank information, not just first preferences; this makes it a richer aggregation than majority rule. Its computation is simple, requires no extra parameter, and is easy to explain to a decision-maker. Because it can bring forward an alternative that is broadly accepted but never ranked first on any list, it rewards balanced alternatives rather than extreme preferences.
Weaknesses
Its limitations follow from this same structure. The Borda count violates the independence of irrelevant alternatives condition; adding or removing an alternative from the set can change the order of the remaining alternatives (Young, 1974). In what is known as the Borda paradox, the most-preferred first-choice alternative may not come first in the Borda ranking; this is a consequence of the method operating on a different logic from majority rule. The scoring treats the distance between rank steps as equal; the gap between second and third on a list is weighted the same as the gap between first and second, even though the actual strength of preference may differ.
Common Mistakes
The most common mistake is adding a new alternative once the analysis is finished and being surprised that the order of the remaining alternatives changes; the set of alternatives must be fixed before the analysis. A second mistake is reading the Borda score as "how many people made this alternative their first choice"; the score sums position across the lists, it does not simply count first preferences. A third mistake is proceeding to scoring without first correcting a rank list that contains an incomplete ranking; an incomplete ranking distorts the value of m and, with it, the scores.
The governing principle is this:
The Borda score measures an alternative's broad acceptance across the lists; unless the set of alternatives is held fixed and the score is not read as simply "most preferred," the result can be misunderstood.
Cases
Each case opens with several rank lists and shows how the Borda score combines them.
1. Aggregation: Combining three alternatives from three rank lists (Borda, 1781)
Three alternatives (A1, A2, A3) are assessed using three separate rank lists (C1, C2, C3).
| Alternative | C1 | C2 | C3 |
|---|---|---|---|
| A1 | 1 | 3 | 2 |
| A2 | 2 | 1 | 3 |
| A3 | 3 | 2 | 1 |
The method sums each alternative's score across the three lists (for m=3, rank 1 earns 2 points, rank 2 earns 1 point, rank 3 earns 0 points).
| Alternative | Borda score |
|---|---|
| A1 | 3 |
| A2 | 3 |
| A3 | 3 |
The result reads as follows: each of the three alternatives came first exactly once, second exactly once and third exactly once across the three lists; because of this symmetric distribution the Borda scores come out equal and the final rank is a tie. This is not a flaw in the Borda count; the table was deliberately built to be perfectly symmetric, and the method reflects that symmetry correctly.
The decision-maker hesitates here: when the scores tie, the Borda count alone does not determine a winner; another rule (a draw, an additional criterion, or priority given to one of the lists) must be brought in. This means the three lists exactly balance one another, with no alternative outranking the others.
In the report: "The three lists produced equal scores (3 for each alternative); the lists exactly balance one another, and no single winner can be determined without an additional tie-breaking rule."
Source: an illustrative example based on the positional scoring rule Borda (1781) proposed. The figures are taken from DecisionMind's validation table to show the rule's behaviour in a symmetric case; they are not the historical text's own example.
2. Theatre: Five critics ranking three plays
At a theatre festival, five critics ranked three plays (A, B, C): three critics ranked A first, B second, C third; two critics ranked B first, C second, A third.
By a plain count of "who was ranked first most often," A receives three first-place votes and B two; A appears to lead. But the Borda count (m=3) gives a different result: A receives 2 points each from three critics (6 in total) and 0 points each from two critics (0 in total), totalling 6. B receives 1 point each from three critics (3 in total) and 2 points each from two critics (4 in total), totalling 7. C receives 0 from three critics and 1 point each from two critics, totalling 2.
| Play | First-place count | Borda score |
|---|---|---|
| A | 3 | 6 |
| B | 2 | 7 |
| C | 0 | 2 |
The festival jury hesitates here: although A received more first-place votes, B leads in the Borda count, because the critics who did not rank B first placed it second, whereas the critics who did not rank A first placed it third. This is a classic example of the Borda paradox: an alternative with broad acceptance can overtake the one most often chosen first.
In the report: "By Borda score, play B (7 points) overtakes play A (6 points); although A received more first-place votes, B enjoys broader second-place support among the critics. If the award rule is the Borda count, the winner is B."
3. Mining: Combining three equipment suppliers from three engineers' scores
At a mining operation, three engineers each ranked three equipment suppliers (M1, M2, M3) in their own round of assessment.
| Supplier | Engineer 1 | Engineer 2 | Engineer 3 |
|---|---|---|---|
| M1 | 1 | 2 | 1 |
| M2 | 2 | 1 | 3 |
| M3 | 3 | 3 | 2 |
The Borda scores (m=3) come out 5 for M1, 3 for M2, 1 for M3; the final rank is M1, M2, M3. Applying mean rank to the same table would give a mean rank of 1.33 for M1, 2.00 for M2, and 2.67 for M3, and the final rank would again be M1, M2, M3; the two methods give exactly the same order.
This is not a coincidence: the Borda score is always an inverted transformation of the mean rank. An alternative's Borda score is found by subtracting the product of that alternative's mean rank and the number of lists from the product of the number of alternatives and the number of lists; as a result, the larger the Borda score, the smaller the mean rank, and the two methods always produce the same final order. The only difference between them is whether the result is read as "higher is better" (Borda) or "lower is better" (mean rank).
The operation does not hesitate here, because since both methods give the same order, which one is chosen makes no practical difference; the real decision is which output form (score or rank) is clearer for reporting.
In the report: "Based on the three engineers' scoring, M1 comes first both in the Borda count (5 points) and in mean rank (1.33); the two methods produce mathematically identical orders from the same data."
4. What Not to Do
In the second case, seeing that play A received more first-place votes and concluding "the Borda count gave the wrong result, the real winner is A" is wrong; the Borda count answers a different question (broad acceptance), not the question majority rule answers (most first-place votes); the two rules producing different winners is not an error but an expected consequence of how the rules are defined. A second error is ignoring the tie in the first case and declaring one of the alternatives the winner without justification; in a tie, an additional rule must be specified. A third error is adding a fourth alternative once the analysis is finished and being surprised that the order of the existing three alternatives changes; Borda scores depend on the number of alternatives, and the result is not reliable unless the set is fixed beforehand.
Sources
For the formula behind each step and the intermediate tables, see the DecisionMind method page: decisionmind.app/library/borda
Borda, J.-C. de (1781). Mémoire sur les Élections au Scrutin. Histoire de l'Académie Royale des Sciences, Paris, 657–665. (no DOI)
Black, D. (1958). The Theory of Committees and Elections. Cambridge University Press. (no DOI)
Young, H. P. (1974). An axiomatization of Borda's rule. Journal of Economic Theory, 9(1), 43–52. DOI: 10.1016/0022-0531(74)90073-8
Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the Web. Proceedings of the 10th International Conference on World Wide Web, 613–622. DOI: 10.1145/371920.372165