Why Two Voting Rules Choose Different Winners
Voting rules translate a profile of rankings into a single winner by emphasizing different things — frequency of being first, average rank, or head-to-head victories — and these emphases are mathematically incompatible whenever a Condorcet loser exists.
A complete interactive classroom, not just a preview.
Start when you are ready to enter this Stage's 9 scenes and explore, respond, and learn as you go.
Why can two voting rules, both applied to the exact same ranked ballots, pick different winners?
An election with only 100 voters can have two 'fair' systems announce two different winners — and both are mathematically defensible.
Most people assume any reasonable voting rule must agree on who wins. They don't, and the disagreement reveals a hidden tension in what 'fair' even means.
A constructed 100-voter mini-election will be tabulated under plurality, Borda, and Condorcet methods side by side, so the contradiction is visible in numbers.
Arrow's impossibility theorem will be named and shown in action: when voters face more than two choices, no ranked rule can satisfy all of 'unrestricted domain,' 'unanimity,' and 'no one-vote dictatorship' at once.
Probably one of the rules is just 'wrong' or unfair, and fixing the calculation would make them all agree.
- Strategic voting and tactical manipulation
- Approval voting and score voting mechanics beyond a brief mention
- Proportional representation and multi-winner systems
- Real-world electoral college or party-primary systems
- 01The Same Ballots, Two WinnersslideQuestion
Present the driving question and frame the paradox: two reasonable voting rules, applied to the same set of ranked ballots, can crown different candidates. Show a stylized election preview — five candidates (A, B, C, D, E) and 100 voters — to set up the concrete example used throughout the investigation.
- Same electorate, same ranked ballots, different winners
- This is not fraud; both results are mathematically correct
- The investigation will build one specific 100-voter profile that triggers the split
- 02Commit to a First GuessquizPrediction
Ask the learner to pick the most likely reason two voting systems would disagree on a winner, before any evidence is shown.
- Forces an explicit commitment to a hypothesis
- Surfaces the common assumption that one rule must simply be 'wrong'
- 03Tabulate Three Rules on the Same ProfileinteractiveEvidence
Interactive table where the learner can switch the scoring rule (Plurality, Borda count, head-to-head / Condorcet) and see the winner change for one fixed electorate of 100 ranked ballots across candidates A–E.
- Same ballots in every column; only the rule changes
- Plurality: count of first-place ranks
- Borda: weighted sum of rank positions
- Condorcet: pairwise head-to-head victories across all pairs
- 04Reading the Three ColumnsslideEvidence
Display the numeric result of the interaction: e.g., Plurality picks B (28 first-place), Borda picks C (highest average rank), Condorcet picks D (beats every other candidate head-to-head). Make the split undeniable.
- Three different winners from identical ballots
- Each winner is defensible by the rule that produced it
- The Condorcet winner D is often the one voters intuitively judge 'best'
- 05Each Rule Measures a Different Kind of 'Best'slideExplanation
Explain that Plurality rewards being 'someone's top choice,' Borda rewards 'broadly liked,' and Condorcet rewards 'universally preferred.' These are three distinct mathematical objectives that are not guaranteed to peak on the same candidate.
- Plurality optimizes: maximize first-place votes
- Borda optimizes: maximize average rank across all voters
- Condorcet optimizes: maximize pairwise win count
- With three or more options, these maxima need not coincide
- 06When the Rules Actually Agree: The Two-Candidate CaseslideBoundary
Show the boundary condition: with only two candidates, every reasonable ranked rule produces the same winner. The split is a phenomenon specific to three or more alternatives.
- Two-candidate elections: Plurality, Borda, and Condorcet all agree
- Disagreement appears the moment a third option is added
- This is why every real voting paradox is about three or more choices
- 07Build an Intuition for Arrow's ImpossibilityinteractiveExplanation
Interactive explorer: the learner adjusts three fairness properties (Unrestricted Domain, Unanimity/Pareto, Independence of Irrelevant Alternatives) and sees whether any combination can be satisfied by a single rule on 3+ alternatives. The point is to feel the impossibility rather than prove it formally.
- Property 1: Unrestricted Domain — any set of rankings is allowed
- Property 2: Unanimity — if everyone ranks X first, X must win
- Property 3: IIA — adding a spoiler candidate should not flip the winner
- Try to keep all three on at once; the system will push back
- 08Transfer: Apply the Same Logic to a New Mini-ElectioninteractiveTransfer
Hand the learner a new tiny ranked-ballot profile (e.g., 15 voters, 4 candidates) and ask them to predict which rule will produce which winner, then verify by tabulating. This transfers the explanatory principle to a novel, simpler situation.
- Predict the Plurality, Borda, and Condorcet winners before computing
- Identify whether this profile has a 'Condorcet loser' — the structural trigger for splits
- Confirm: whichever candidate is the Condorcet loser is exactly whose standing the rules disagree on
- 09Answering the Driving QuestionslideResolution
Close the investigation by directly answering: two voting rules disagree because they optimize different definitions of 'best,' and Arrow's impossibility theorem proves these definitions cannot be unified into a single rule once there are three or more alternatives.
- The disagreement is structural, not an error
- It is triggered specifically by the presence of a Condorcet loser
- Arrow's theorem: no rule on 3+ options satisfies all three fairness properties
- Choosing a voting rule is therefore choosing which definition of 'best' to honor
Discussion threads for a Stage aren't available yet.
This path ends here.