AI summary by TwinMind

Why Democracy Is Mathematically Impossible

Veritasium

23m 34s

Introduction to Democratic Voting Problems

  • Democracy might be mathematically impossible - well-established mathematical fact, not value judgment
  • Current democratic methods for electing leaders are fundamentally irrational
  • Video covers math that proved this fact and led to Nobel Prize
  • Focus on how groups make decisions and associated pitfalls

First Past The Post Voting System

  • Simplest election method: voters mark one candidate as favorite, most votes wins
  • Name is misnomer - no actual "post" threshold needed
  • Historical usage:
    • Likely dates back to antiquity
    • Used in England House of Commons since 14th century
    • Currently used by 44 countries worldwide (30 former British colonies)
    • US uses it in most states for electoral college representatives

Problems with First Past The Post

  • Minority rule problem: majority of country often doesn't vote for winning party
    • In last 100 years: 21 times single party held majority in British Parliament
    • Only 2 of those times did majority of voters actually vote for that party
  • Spoiler effect: similar parties steal votes from each other
    • 2000 US presidential election example:
      • Bush vs Gore essentially
      • Bush won Florida by fewer than 600 votes
      • Ralph Nader (Green candidate) got almost 100,000 votes in Florida
      • Most Nader voters preferred Gore to Bush but couldn't express this preference
  • Strategic voting incentive: leads to two-party system concentration
    • Duverger's Law: Winner-takes-all systems lead to two-party concentration

Instant Runoff/Ranked Choice Voting

  • Alternative requiring majority (50% + 1) to win
  • Process: voters rank preferences from favorite to least favorite
  • If no majority on first count:
    • Eliminate candidate with fewest votes
    • Redistribute their ballots to voters' second preferences
    • Repeat until one candidate has majority
  • Mathematically identical to holding repeated elections
  • Also known as preferential voting or ranked choice voting

Effects on Candidate Behavior

  • Minneapolis mayor's race 2013 example:
    • 35 candidates running
    • All candidates were extremely cordial and polite to each other
    • Final debate ended with all candidates singing "Kumbaya" together
    • Candidates sought second/third choice rankings, incentivizing kindness

Problems with Instant Runoff

  • Paradoxical outcomes where doing worse can help candidate win
  • Example with Einstein, Curie, and Bohr:
    • Initial: Einstein 25%, Curie 30%, Bohr 45%
    • Einstein eliminated, Curie wins with Einstein voters' second choices
    • If Bohr performs worse and loses some voters to Einstein:
      • Curie gets eliminated instead
      • Bohr wins despite performing worse initially

Historical Development of Voting Theory

  • Marquis de Condorcet: French mathematician during French Revolution
  • One of founders of social choice theory
  • Applied logic and mathematics to rigorously study voting systems
  • Working during French Revolution when determining will of people was culturally important

Borda Count System (1784)

  • Proposed by Jean Charles de Borda at French Royal Society of Science
  • Method: voters rank candidates, points awarded based on ranking
    • With 5 candidates: 1st place = 4 points, 2nd = 3 points, etc.
    • Last place = 0 points
  • Problem: total number of candidates affects point distribution
  • Adding irrelevant candidates can change winner
  • Condorcet criticized it as "bound to lead to error"

Condorcet Method (1785)

  • Winner must beat every other candidate in head-to-head election
  • Implementation: voters rank preferences, count head-to-head matchups
  • Feels like most fair voting method
  • Actually discovered 450 years earlier by Raymond Lull (monk studying church leader selection)
  • Lull's book "Ars Electionis" was lost, only rediscovered in 2001

Condorcet's Paradox

  • Example with three friends choosing dinner (burgers, pizza, sushi):
    • Friend 1: Burgers > Pizza > Sushi
    • Friend 2: Pizza > Sushi > Burgers
    • Friend 3: Sushi > Burgers > Pizza
  • Creates circular preference: Burgers > Pizza > Sushi > Burgers
  • No clear Condorcet winner exists
  • Condorcet died before resolving this problem
    • Politically active during French Revolution
    • Wrote draft of France's Constitution
    • 1793: deemed traitor during Reign of Terror for criticizing regime
    • 1794: arrested and died in jail

150 Years of Voting System Development

  • Dozens of mathematicians proposed new systems or modifications
  • Charles Dodgson (Lewis Carroll) worked on fair election systems when not writing Alice in Wonderland
  • Every voting system had similar problems:
    • Condorcet loops
    • Irrelevant candidates affecting outcomes

Arrow's Impossibility Theorem (1951)

  • Kenneth Arrow published PhD thesis outlining five reasonable conditions for voting systems
  • Proved satisfying all five conditions simultaneously is impossible with 3+ candidates
  • Arrow awarded Nobel Prize in Economics (1972)

Arrow's Five Conditions

  1. Unanimity: If everyone prefers option A over B, group should prefer A over B
  2. Non-dictatorship: No single person's vote should override everyone else's preferences
  3. Unrestricted Domain: Everyone can vote however they want, system must always produce conclusion
  4. Transitivity: If group prefers A>B and B>C, then group should prefer A>C
  5. Independence of Irrelevant Alternatives: Group preference between A and B shouldn't change when option C is introduced

Proof Outline (Geanakoplos formulation)

  • Three candidates: A, B, C with voters 1, 2, 3...n
  • First proves: if everyone ranks candidate first or last, society must also rank them first or last
  • Thought experiment with candidate B:
    • Profile 0: everyone puts B at bottom
    • Profile 1,2,3...: progressively move one voter's B from bottom to top
    • Eventually reaches "pivotal voter" whose change flips society's ranking
    • This pivotal voter becomes dictator for all pairwise comparisons
    • Violates non-dictatorship condition

Potential Solutions and Alternatives

Duncan Black's Median Voter Theorem

  • More optimistic result than Arrow's theorem
  • If voters/candidates spread along single dimension (liberal-conservative spectrum)
  • Median voter's preference reflects majority decision
  • Avoids Arrow's paradoxes and inconsistencies
  • Aligns with majority of voters

Rated Voting Systems

  • Arrow's theorem only applies to ordinal (ranking) systems
  • Alternative: rated voting where voters indicate approval/disapproval levels
  • Approval Voting: simplest version
    • Voters tick candidates they approve of
    • Count percentage approval for each candidate
    • Highest approval wins
  • Score Voting: rate candidates on scale (e.g., -10 to +10)

Benefits of Approval Voting

  • Increases voter turnout
  • Decreases negative campaigning
  • Prevents spoiler effect
  • Voters can express approval without worrying about party size
  • Simple to tally and understand
  • Historical usage:
    • Vatican priests elected popes 1294-1621
    • Currently used to elect UN Secretary General
  • Kenneth Arrow initially skeptical but later agreed it was likely best method

Conclusions

  • Democracy mathematically impossible using ranked choice methods (what most countries use)
  • Some methods clearly better than others at aggregating preferences
  • First past the post voting has significant flaws
  • Perfect systems don't exist, but shouldn't stop political engagement
  • Winston Churchill quote: "Democracy is worst form of government except for all other forms that have been tried"
  • Democracy not perfect but best available option

TwinMind

Get summaries like this for your own meetings

TwinMind takes notes in the background during meetings, lectures, and calls, then writes the summary for you.

Free plan to get started

No bot joins your calls

Phone, desktop & Chrome apps

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome