AI summary by TwinMind
Voting Paradoxes - Numberphile
Numberphile
11m 27s
Condorcet Paradox Introduction
- Nearly half the world having elections this year
- Example scenario: 3 voters, 3 candidates (A, B, C)
- Voter preferences:
- Voter 1: A > B > C
- Voter 2: B > C > A
- Voter 3: C > A > B
- Creates circular preference loop: C beats A, A beats B, B beats C
- Known as rock-paper-scissors problem in voting theory
Historical Context
- Named after Condorcet (French political philosopher/mathematician, Age of Enlightenment)
- Earlier discovery by Ramon Lull (13th century Spanish mathematician)
- Lull's work mostly lost, Condorcet popularized the concept
Winner Types in Elections
- Majority Winner: At least half of voters support candidate in one-on-one competition against any individual
- Requires at least 2 voters (in 3-voter scenario) supporting candidate against any other
- Condorcet Winner: Only needs to be unbeaten, allows for ties
- Not always a Condorcet winner exists
- Real-world correlation between preferences reduces likelihood
- Random occurrence probability: <10%
- Systematic occurrence probability: very small
Smith Set Theory
- Always exists when no Condorcet winner
- Property: No candidate in Smith set beaten by candidate outside set
- Smallest set with this property
- If Condorcet winner exists, Condorcet winner = Smith set
- Worst case: Smith set = all candidates
Graph Theory Connection
- Voting theorists collaborate with graph theorists
- Graph theory calls this a "tournament"
- "Dominating set": beats everything outside it
- Key property: Dominating sets nest
- Ensures unique Smith set exists
Copeland Method for Finding Smith Set
- Matrix representation of election results
- Example with candidates A, B, C, D, E, F
- Copeland score = sum of row values
- Example scores: A=4, B=0.5, C=3, D=0.5, E=4, F=3
- Rank by Copeland score
- Two highest scores automatically in Smith set (A, E)
- Add candidates that beat Smith set members iteratively
- Final Smith set: A, E, C, F
Three Voting Methods
1. Copeland Method
- Winner = highest Copeland score
- Sometimes produces winner even without Condorcet winner
- Not always unique winner
2. Minimax Method
- Formula: ArgMin over X of Max over Y of Score(Y,X)
- Finds candidate who concedes least points in worst match
- Good for defensive strategies (like England football team vs Scotland)
3. Dodgson Method
- Created by Charles Dodgson (Lewis Carroll of Alice in Wonderland)
- Looks at fewest pairwise swaps to become Condorcet winner
- Problem: doesn't always uniquely identify winner
- Example: Both A and B could become Condorcet winner with one swap each
Voting System Verification Challenges
- Paper ballots provide verifiability at casting
- Trust required in chain of custody and counting process
- Electronic voting software verification challenges
- Checksums/crypto solutions just move trust problem
- Individual verification impractical for most voters
