e-voting

Tom Scott explains why electronic voting is a bad idea. Elections must be trusted by everyone and attacks on software scale in ways attacks on paper do not, so open source or blockchain fixes do not solve it.

Tom Scott explains for Computerphile why electronic voting is a bad idea, arguing that paper ballots are transparent, auditable and hard to tamper with at scale. He covers why moving voting to phones, tablets or computers undermines trust and verifiability.

An animated simulation comparing single-winner voting methods such as plurality, instant runoff and STAR. Colored regions show which candidate wins as a randomized electorate shifts across a two-dimensional political space, building on Ka-Ping Yee's earlier diagrams.

The Center for Election Science explains favorite betrayal in instant-runoff voting: in some elections, ranking your favorite first can cause your least favorite to win. It contrasts this with plurality voting's spoiler problem.

A six-minute explainer from Undefined Behavior on range (score) voting. It follows an earlier video on Arrow's Theorem and shows how range voting seems to satisfy the criteria Arrow's Theorem says no ranked system can.

Primer uses simulations to compare voting systems such as first-past-the-post, approval, ranked choice and others. It shows how each system behaves and can be manipulated, with links to further voting theory resources.

A short CGP Grey explainer on the alternative vote (instant runoff voting) versus first past the post, made around the 2011 UK referendum. It shows how ranked ballots are tallied and why they avoid spoiler effects.

CGP Grey explains the Single Transferable Vote, a proportional ranked-ballot system, and why politicians have little incentive to adopt it. It is a short animated explainer of how multi-winner ranked voting works.

CGP Grey explains Mixed-Member Proportional representation, the system used in New Zealand where voters get two votes. It covers how it differs from first-past-the-post.

Veritasium explains why no voting system can be perfectly fair, drawing on Arrow's theorem and the work of Eric Maskin. It looks at problems with systems like first-past-the-post and ranked-choice voting.

Numberphile interviews cryptographer Ron Rivest about end-to-end verifiable voting. He explains how homomorphic encryption and receipts let a voter confirm their ballot was counted without being able to prove how they voted to anyone else.

CGP Grey explains first-past-the-post voting and why it pushes elections toward two dominant parties. It is the first in his series on electoral systems.

CGP Grey explains how the 2015 UK general election showed the flaws of first-past-the-post voting, with parties like UKIP winning many votes but few seats.

A short CGP Grey animation showing how the US electoral college lets a candidate win the presidency with as little as about 22 percent of the popular vote. It lays out the arithmetic of winning states by narrow margins.

A five-minute animated explainer of liquid democracy, in which voters can delegate their vote to trusted people. It starts from the origins of democracy and contrasts direct and representative models.

A short CGP Grey bonus video explaining the shortest-splitline algorithm, which draws electoral districts by repeatedly splitting a state along its shortest dividing line while balancing population. It is offered as a neutral, algorithmic fix for gerrymandering.