AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Exclusion Zones of Instant Runoff Voting

Kiran Tomlinson, Johan Ugander, Jon Kleinberg

AAAI 2026 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
move from small trees to larger trees (n=3 to n=15)Tree graph voting · Treescount with nontrivial IRV exclusion zone: 7572 of 7741 trees at n=15Improved
apply approximation algorithm to real school social networksIRV graph voting · 56 school networksshare with nontrivial exclusion zone: 33 of 56 (59%); zones average 92% of graphMixed
tighten approximation parameters from 0.01 to 0.005 for school 26Randomized approximation algorithm · School 26zone size as share of graph: 9% -> 98.5%Mixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy