Research map / Graph learning / Graph algorithms and clustering
Exclusion Zones of Instant Runoff Voting
Kiran Tomlinson, Johan Ugander, Jon Kleinberg
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| move from small trees to larger trees (n=3 to n=15) | Tree graph voting · Trees | count with nontrivial IRV exclusion zone: 7572 of 7741 trees at n=15 | Improved |
| apply approximation algorithm to real school social networks | IRV graph voting · 56 school networks | share with nontrivial exclusion zone: 33 of 56 (59%); zones average 92% of graph | Mixed |
| tighten approximation parameters from 0.01 to 0.005 for school 26 | Randomized approximation algorithm · School 26 | zone size as share of graph: 9% -> 98.5% | Mixed |
Closest papers by meaning
- The Moderating Effect of Instant Runoff Voting (AAAI 2024 · similarity 0.90)
- Tight Bounds on the Distortion of Randomized and Deterministic Distributed Voting (NeurIPS 2025 · similarity 0.84)
- Spatial Voting with Incomplete Voter Information (AAAI 2024 · similarity 0.84)
- On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries (AAAI 2025 · similarity 0.82)
- Proportional Fairness in Clustering: A Social Choice Perspective (NeurIPS 2024 · similarity 0.82)
- Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences (NeurIPS 2026 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
