English
Related papers

Related papers: Ballot Length in Instant Runoff Voting

200 papers

Instant Runoff Voting (IRV) is used in elections for many political offices around the world. It allows voters to specify their preferences among candidates as a ranking. We identify a generalization of the rule, called Approval-IRV, that…

Computer Science and Game Theory · Computer Science 2024-04-18 Théo Delemazure , Dominik Peters

Instant runoff voting (IRV) has recently gained popularity as an alternative to plurality voting for political elections, with advocates claiming a range of advantages, including that it produces more moderate winners than plurality and…

Multiagent Systems · Computer Science 2024-01-19 Kiran Tomlinson , Johan Ugander , Jon Kleinberg

In ranked-choice elections voters cast preference ballots which provide a voter's ranking of the candidates. The method of ranked-choice voting (RCV) chooses a winner by using voter preferences to simulate a series of runoff elections. Some…

General Economics · Economics 2023-06-12 Mallory Dickerson , Erin Martin , David McCune

I derive the probability that a vote cast in an Instant Runoff Voting election will change the election winner. I phrase that probability in terms of the candidates' expected vote totals, and then I estimate its magnitude for different…

Computer Science and Game Theory · Computer Science 2025-09-24 Samuel Baltz

We analyze the susceptibility of instant runoff voting (IRV) to a lesser-studied paradox known as a \emph{reinforcement paradox}, which occurs when candidate $X$ wins under IRV in two distinct elections but $X$ loses in the combined…

Physics and Society · Physics 2026-04-20 David McCune , Jennifer Wilson

Elections where electors rank the candidates (or a subset of the candidates) in order of preference allow the collection of more information about the electors' intent. The most widely used election of this type is Instant-Runoff Voting…

Computers and Society · Computer Science 2023-12-06 Michelle Blom , Peter J. Stuckey , Vanessa Teague , Damjan Vukcevic

Recent research on instant runoff voting (IRV) shows that it exhibits a striking combinatorial property in one-dimensional preference spaces: there is an "exclusion zone" around the median voter such that if a candidate from the exclusion…

Multiagent Systems · Computer Science 2025-03-11 Kiran Tomlinson , Johan Ugander , Jon Kleinberg

Instant-runoff voting (IRV) is often used when voters rank candidates rather than choosing only one favourite. We study IRV under graph-induced metric preferences where each vertex of an unweighted undirected graph hosts one voter and is…

Computer Science and Game Theory · Computer Science 2026-05-13 Georgios Birmpas , Georgios Chionas , Efthyvoulos Drousiotis , Soodeh Habibi , Marios Mavronicolas , Paul Spirakis

We present the core support criterion, a voting criterion satisfied by Instant Runoff Voting (IRV) that is analogous to the Condorcet criterion but reflective of a different majority rule philosophy. Condorcet methods can be thought of as…

Theoretical Economics · Economics 2024-07-12 Ross Hyman , Deb Otis , Seamus Allen , Greg Dennis

Instant-runoff voting (IRV) is used in several countries around the world. It requires voters to rank candidates in order of preference, and uses a counting algorithm that is more complex than systems such as first-past-the-post or scoring…

We analyze how frequently instant runoff voting (IRV) selects the weakest (or least popular) candidate in three-candidate elections. We consider four definitions of ``weakest candidate'': the Borda loser, the Bucklin loser, the candidate…

General Economics · Economics 2026-02-26 David McCune , Jennifer Wilson

How can we probabilistically predict the winner in a ranked-choice election without all ballots being counted? In this study, we introduce a novel algorithm designed to predict outcomes in Instant Runoff Voting (IRV) elections. The…

Computers and Society · Computer Science 2024-05-16 Nicholas Kapoor , P. Christopher Staecker

We study the limit CM rate of single-winner voting rules under Impartial Culture, defined as the probability that a preference profile is coalitionally manipulable in the limit of large electorates. For m = 3 candidates, Lepelley and…

Computer Science and Game Theory · Computer Science 2026-05-25 François Durand , Élie de Panafieu , Guillem Perarnau

The communication complexity of a voting rule is the worst-case number of bits that n voters must transmit to a central authority under the most efficient elicitation protocol in an election with m candidates. We study the communication…

Multiagent Systems · Computer Science 2026-05-25 Élie de Panafieu , François Durand , Jérôme Lang

Risk-limiting post election audits guarantee a high probability of correcting incorrect election results, independent of why the result was incorrect. Ballot-polling audits select ballots at random and interpret those ballots as evidence…

Data Structures and Algorithms · Computer Science 2019-10-30 Michelle Blom , Peter J. Stuckey , Vanessa Teague

Multi-winner approval elections are seen in a variety of settings ranging from academic societies and associations to public elections. In such elections, it is often the case that ballot-length restrictions are enforced; that is, where…

Computer Science and Game Theory · Computer Science 2017-11-15 Barton E. Lee

The margin of victory is easy to compute for many election schemes but difficult for Instant Runoff Voting (IRV). This is important because arguments about the correctness of an election outcome usually rely on the size of the electoral…

Artificial Intelligence · Computer Science 2015-08-21 Michelle Blom , Peter J. Stuckey , Vanessa J. Teague , Ron Tidhar

Ranked voting systems, such as instant-runoff voting (IRV) and single transferable vote (STV), are used in many places around the world. They are more complex than plurality and scoring rules, presenting a challenge for auditing their…

This article extends the analysis of Atkinson, Foley, and Ganz in "Beyond the Spoiler Effect: Can Ranked-Choice Voting Solve the Problem of Political Polarization?". Their work uses a one-dimensional spatial model based on survey data from…

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov
‹ Prev 1 2 3 10 Next ›