Ranked preference ballot tally
Tally complete rankings with Borda scores and pairwise counts for a nonbinding group preference comparison.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
With n candidates, rank r scores n−r. A Condorcet winner beats every other candidate in pairwise counts.
For the default 3 ballots, Park=4, Museum=3, Cafe=2 and Park beats every opponent.
Use 2–10 candidates and at most 100 ballots, with names up to 30 characters. Every ballot must rank the same candidates completely; this is not an official election system. Decimal results display at most 12 significant digits.
Frequently asked questions
Are tied or incomplete rankings supported?
No. Duplicate or missing candidates are rejected rather than given inferred ranks.
Is no Condorcet winner a ballot error?
No. Cyclic preferences or ties may prevent a winner; inspect pairwise counts before choosing a decision rule.
Calculation criteria and reference materials
- CMU: voting systems
Borda and pairwise majority preference.
Verification of calculation criteria: · Calculation·verification principles · Report errors