English
Related papers

Related papers: Can ranked-choice voting elect the least popular c…

200 papers

Instant runoff voting (IRV) is an increasingly-popular alternative to traditional plurality voting in which voters submit rankings over the candidates rather than single votes. In practice, elections using IRV often restrict the ballot…

Multiagent Systems · Computer Science 2022-12-06 Kiran Tomlinson , Johan Ugander , Jon Kleinberg

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

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

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

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

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

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

In this paper, we provide theoretical and empirical estimates for the likelihood of a negative participation paradox under instant runoff voting in three-candidate elections. We determine the probability of the paradox and related…

Physics and Society · Physics 2024-10-24 David McCune , Jennifer Wilson

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

By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to…

Artificial Intelligence · Computer Science 2025-02-25 Wesley H. Holliday , Alexander Kristoffersen , Eric Pacuit

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

Several election districts in the US have recently moved to ranked-choice voting (RCV) to decide the results of local elections. RCV allows voters to rank their choices, and the results are computed in rounds, eliminating one candidate at a…

Computers and Society · Computer Science 2022-06-28 Alborz Jelvani , Amélie Marian

We study voting rules with respect to how they allow or limit a majority from dominating minorities: whether a voting rule makes a majority powerful, and whether minorities can veto the candidates they do not prefer. For a given voting…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Y. Kondratev , Alexander S. Nesterov

To aggregate rankings into a social ranking, one can use scoring systems such as Plurality, Veto, and Borda. We distinguish three types of methods: ranking by score, ranking by repeatedly choosing a winner that we delete and rank at the…

Computer Science and Game Theory · Computer Science 2022-09-20 Niclas Boehmer , Robert Bredereck , Dominik Peters

From the perspective of social choice theory, ranked-choice voting (RCV) is known to have many flaws. RCV can fail to elect a Condorcet winner and is susceptible to monotonicity paradoxes and the spoiler effect, for example. We use a…

General Economics · Economics 2023-03-07 Adam Graham-Squire , David McCune

We conjecture that Borda count is the ranked choice voting method that best preserves the outcome of an election with randomly corrupted votes, among all fair voting methods with small influences satisfying the Condorcet Loser Criterion.…

Computer Science and Game Theory · Computer Science 2022-09-23 Steven Heilman

Various voting rules are based on ranking the candidates by scores induced by aggregating voter preferences. A winner (respectively, unique winner) is a candidate who receives a score not smaller than (respectively, strictly greater than)…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

The standard voting methods in the United States, plurality and ranked choice (or instant runoff) voting, are susceptible to significant voting failures. These flaws include Condorcet and majority failures as well as monotonicity and…

General Economics · Economics 2025-01-10 N. Bradley Fox , Benjamin Bruyns

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial…

Computer Science and Game Theory · Computer Science 2014-01-17 Lirong Xia , Vincent Conitzer

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
‹ Prev 1 2 3 10 Next ›