Arrow's Impossibility Theorem
Arrow's theorem proves that no ranked-ballot voting rule with three or more options can simultaneously satisfy every basic fairness condition—at least one must be sacrificed.
A complete interactive classroom, not just a preview.
Start when you are ready to enter this Stage's 4 scenes and explore, respond, and learn as you go.
What does Arrow's impossibility theorem say about ranked-ballot voting systems with three or more options?
A club of 100 friends must pick a movie night film by each ranking the three options. Everyone feels their favorite is most popular, yet every voting rule they invent seems to betray someone's preference.
We assume that with ranked ballots we can simply 'add up' preferences to find a fair winner—but what if no rule can satisfy all the fairness conditions we intuitively want?
Show a concrete 3-candidate, 3-voter example where the Condorcet winner, plurality, and Borda count each pick a different candidate, then show that whichever rule you choose, at least one fairness condition breaks.
Arrow's theorem proves that any ranked-ballot system combining more than two options must violate at least one core fairness condition—so the debate is not which rule is perfect, but which flaw we accept.
- approval voting
- range voting
- cardinal utility voting
- computational complexity of manipulation
- Gibbard-Satterthwaite theorem
- 01The Fairness ParadoxslideSlot 1Hook
A small club tries to pick a movie from three options using ranked ballots, but every rule they propose seems unfair to someone.
- Ranked ballots capture richer preferences than single votes
- Intuitively, fairness should be achievable with more information
- Yet no rule the club invents satisfies everyone
PhenomenonThree friends rank three movies; every voting rule picks a different 'fair' winner.
QuestionIf ranked ballots give us more preference information, why can't we find a single fair way to combine them?
- 02Why More Information Should HelpslideSlot 2Tension
Most voters assume ranked ballots must be fairer than simple voting, because they reveal intensity and order.
- Common belief: ranked data enables a 'correct' aggregation
- Several plausible rules exist: plurality, Borda, Condorcet
- Each rule feels fair on its own but they disagree on winners
PredictionRanked ballots should let us design a voting rule that respects everyone's top choices and never produces a paradox.
Tempting intuitionIf we just use a smart formula—pairwise comparisons, point systems, or runoffs—the people's true preferences will emerge cleanly.
- 03Arrow's Three ConditionsslideSlot 3Reveal
Arrow's theorem pinpoints three minimal fairness conditions and proves no ranked rule can satisfy all three with three or more options.
- Unrestricted domain: any ranking of candidates is allowed
- Pareto efficiency: if everyone prefers A over B, the group should too
- Independence of irrelevant alternatives: the A-vs-B ranking ignores C
- Theorem: no rule meets all three whenever there are ≥3 options
EvidenceArrow's 1951 proof shows that for three or more alternatives, every aggregation rule must drop at least one of Pareto efficiency, IIA, or non-dictatorship.
ConclusionWhenever there are three or more options, ranked-ballot aggregation cannot avoid either ignoring majority preferences or handing power to a single voter.
Mechanism- 1Define the three fairness axioms as formal constraints on a social welfare function
- 2Construct a cycle of pairwise preferences that forces IIA to collapse the ranking into a single decisive voter
- 3Conclude that a decisive voter is a dictator, violating non-dictatorship
- 04Choosing the Flaw We AcceptslideSlot 4Takeaway
Arrow's theorem reframes the voting-design debate: pick which fairness axiom to sacrifice deliberately.
- Borda count sacrifices IIA to honor intensity of preference
- Plurality sacrifices Pareto efficiency for simplicity
- Every real voting system is a trade-off among Arrow's axioms
TransferWhen a city council debates switching from plurality to ranked-choice voting, members should expect a different flaw—not the disappearance of unfairness.
Expected inferenceGiven any proposed ranked-ballot reform with three or more options, the learner should infer that some fairness condition is being traded away and ask which one.
Discussion threads for a Stage aren't available yet.
