Democracy's Mathematical Problem
In 1785, the Marquis de Condorcet discovered something troubling: when three or more candidates compete, majority preferences can form a cycle. Voters might prefer Alice over Bob, Bob over Carol, and Carol over Alice — each by majority vote. There is no 'will of the people' in such cases; collective preferences are irrational even when every individual voter is perfectly rational. This paradox lies at the heart of social choice theory.
Four Voting Methods, Four Answers
This simulation lets you compare four common voting methods on the same set of ballots. Plurality counts only first-choice votes. Instant runoff eliminates the last-place candidate and redistributes their votes. Borda count assigns points by ranking position. Condorcet comparison checks every pairwise matchup. The striking result: these methods often produce different winners from identical voter preferences. The 'right' outcome depends on which method you choose.
Arrow's Impossibility Theorem
In 1951, Kenneth Arrow proved mathematically that no ranked voting system can satisfy a small set of reasonable fairness criteria simultaneously. Every system must violate at least one of: treating all voters equally, respecting unanimous preferences, or being immune to irrelevant alternatives. This Nobel Prize-winning theorem means the search for a 'perfect' voting system is not just difficult — it is mathematically impossible.
Strategic Voting Is Inevitable
The Gibbard-Satterthwaite theorem (1973) adds another blow: any non-dictatorial voting system with three or more candidates can be manipulated by strategic voting. A voter can sometimes get a better outcome by lying about their preferences — voting for a less-preferred candidate to block a worse one. This is not a bug in specific voting systems; it is a fundamental property of collective decision-making with ranked preferences.