


12 videos · 2 hr 17 minCurated by HackerTube · 12 videos · 2 hr 17 min
Every election thread on Hacker News turns into a voting theory seminar, and these are the videos commenters keep linking. The order is a short course: first the problem with plurality voting, then the alternatives and their failure modes, then the math that says no system is perfect, then how district maps and ballot counting can be gamed. Most are under 15 minutes.
Play all on YouTubeCGP Grey · 7.9M views · 15 years ago
Starts with the problem: HN's default explainer of how first-past-the-post pushes any country toward two parties.
Primer · 4.5M views · 6 years ago
Primer's simulated voters run plurality, ranked choice and approval side by side, so you see each system's behavior instead of taking it on faith.
The Center for Election Science · 35K views · 12 years ago
A three-minute warning before you fall for ranked choice: the clip HN posts to show that instant runoff can still punish voters for ranking their favorite first.
Veritasium · 10M views · 2 years ago
Veritasium turns the specific flaws into a general result, walking through Arrow's theorem and why every ranked method gives something up.
Undefined Behavior · 43K views · 10 years ago
Picks up right where Arrow leaves off, showing how score voting sidesteps the theorem by having voters rate candidates instead of ranking them.
Unify The Vote · 16K views · 9 years ago
A little-watched gem: colored win regions across a 2D political space make the case for cardinal methods like STAR better than any argument could.
CGP Grey · 10M views · 12 years ago
Moves from picking one winner to filling a legislature, with HN's standard link for single transferable vote and why incumbents avoid it.
AlphaPhoenix · 584K views · 5 years ago
Even a perfect ballot fails if the map is rigged: AlphaPhoenix uses Monte Carlo search to draw North Carolina districts fair and foul.
pxi · 76K views · 13 years ago
A brief detour into a more radical idea HN keeps returning to: lending your vote to someone you trust, and taking it back when you like.
Tom Scott · 5.1M views · 6 years ago
Then the counting itself: Tom Scott's argument, linked in nearly every e-voting thread, that software attacks scale in ways attacks on paper cannot.
Numberphile · 198K views · 9 years ago
The cryptographer's reply: Ron Rivest explains how a receipt can prove your vote was counted without letting you prove to anyone how you voted.
Stand-up Maths · 3.7M views · 5 years ago
Ends with auditing results: Matt Parker shows when Benford's Law can catch fraud and why it does not apply to precinct totals.