English
Related papers

Related papers: Ballot Length in Instant Runoff Voting

200 papers

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

In real-world elections where voters cast preference ballots, voters often provide only a partial ranking of the candidates. Despite this empirical reality, prior social choice literature frequently analyzes fairness criteria under the…

General Economics · Economics 2024-08-08 Adam Graham-Squire , Matthew I. Jones , David McCune

Classical voting rules assume that ballots are complete preference orders over candidates. However, when the number of candidates is large enough, it is too costly to ask the voters to rank all candidates. We suggest to fix a rank k, to ask…

Computer Science and Game Theory · Computer Science 2020-02-17 Manel Ayadi , Nahla Ben amor , Jérôme Lang

Ranked choice voting is vulnerable to monotonicity failure - a voting failure where a candidate is cost an election due to losing voter preference or granted an election due to gaining voter preference. Despite increasing use of ranked…

Theoretical Economics · Economics 2023-10-23 Rylie Weaver

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

This paper introduces the Voting with Random Proposers (VRP) procedure to address the challenges of agenda manipulation in voting. In each round of VRP, a randomly selected proposer suggests an alternative that is voted on against the…

Theoretical Economics · Economics 2025-10-03 Hans Gersbach , Kremena Valkanova

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

We study the behavior of Range Voting and Normalized Range Voting with respect to electoral control. Electoral control encompasses attempts from an election chair to alter the structure of an election in order to change the outcome. We show…

Computer Science and Game Theory · Computer Science 2012-06-27 Curtis Menton

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

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

A set of $2^n$ candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining ones proceeding to the next…

Combinatorics · Mathematics 2025-12-23 Bernard De Baets , Emilio De Santis

We investigate how robust the results of committee elections are to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules the effect of making a single swap of adjacent candidates…

Computer Science and Game Theory · Computer Science 2019-07-24 Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Rolf Niedermeier , Piotr Skowron , Nimrod Talmon

The Single Transferable Vote (STV) is a system of preferential voting employed in multi-seat elections. Each vote cast by a voter is a (potentially partial) ranking over a set of candidates. No techniques currently exist for computing the…

Computer Science and Game Theory · Computer Science 2017-08-17 Michelle Blom , Peter J. Stuckey , Vanessa J. Teague

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

Elections repeat commonly after a fixed time interval, ranging from months to years. This results in limitations on governance since elected candidates or policies are difficult to remove before the next elections, if needed, and allowed by…

Cryptography and Security · Computer Science 2023-09-26 Sarad Venugopalan , Ivana Stančíková , Ivan Homoliak

We introduce the reputational voter model (RVM) to account for the time-varying abilities of individuals to influence their neighbors. To understand of the RVM, we first discuss the fitness voter model (FVM), in which each voter has a fixed…

Physics and Society · Physics 2019-06-25 D. Bhat , S. Redner

The methods of single transferable vote (STV) and sequential ranked-choice voting (RCV) are different methods for electing a set of winners in multiwinner elections. STV is a classical voting method that has been widely used internationally…

General Economics · Economics 2023-07-03 David McCune , Erin Martin , Grant Latina , Kaitlyn Simms

This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the…

Data Structures and Algorithms · Computer Science 2024-01-22 Lisa Hellerstein , Naifeng Liu , Kevin Schewior

We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval…

Computer Science and Game Theory · Computer Science 2021-04-20 Piotr Faliszewski , Piotr Skowron , Nimrod Talmon

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