Gerrymandering Australia
summary
Explains how hypothetical redraws actually change results by building an optimization pipeline using Voronoi tessellation for booth catchments and integer linear programming to assign regions to seats, running examples small (Canberra, Wollongong) and national (stalls overnight). Cites concrete figures — 8,875 polling booths — and real data limits: booth-level first preferences, missing full preference flows, and an OR-Tools 2GB model limit. Code produces plausible gerrymanders for small areas but hits scalability and data-coverage issues for a robust nationwide system.
AI-written summary · about
chapters (13)
- 0:00Gerrymandering chaos
- 1:09Gerrymandering history and basics
- 3:38Australia’s electoral redraws
- 8:13Preferential voting explained
- 10:02Election data and booth insights
- 12:31Mapping booths with Voronoi
- 15:00Gerrymandering as optimization
- 17:27Linear integer programming
- 19:16Graph theory for electorates
- 22:03Gerrymandering in the ACT
- 23:47Scaling to New South Wales
- 26:56Challenges and future work
- 27:16Q&A
related talks
17mSecrets of Antony Green: Calculating notional margins for electoral redistributions
31mUsing Algorithm X to reanalyse the last UK general election
10mVisualizing voting results
25mHow to put on your designer's hat when crafting map experiences
28mBuilding a scalable public map for Singapore's general elections 2025
01h 05mHow to Steal an Election
01h 42mRecreating, Understanding, and Visualizing FiveThirtyEight's...
30mFighting Gerrymandering with PyMC3