English
Related papers

Related papers: Monotonicity Failure in Ranked Choice Voting -- Ne…

200 papers

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

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 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

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

The probability of a given candidate winning a future election is worked out in closed form as a function of (i) the current support rates for each candidate, (ii) the relative positioning of the candidates within the political spectrum,…

Probability · Mathematics 2025-04-25 Dorje C. Brody , Tomooki Yuasa

This paper formalizes the lattice structure of the ballot voters cast in a ranked-choice election and the preferences that this structure induces. These preferences are shown to be counter to previous assumptions about the preferences of…

Theoretical Economics · Economics 2023-01-10 Brian Duricy

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

Ranked-choice voting anomalies such as monotonicity paradoxes have been extensively studied through creating hypothetical examples and generating elections under various models of voter behavior. However, very few real-world examples of…

General Economics · Economics 2024-11-20 Adam Graham-Squire , David McCune

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

Like many other voting systems, Majority Judgement suffers from the weaknesses of the underlying mathematical model: Elections as problem of choice or ranking. We show how the model can be enhanced to take into account the complete process…

Computer Science and Game Theory · Computer Science 2023-07-07 Friedemann Kemm

We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone.…

Computer Science and Game Theory · Computer Science 2025-12-05 Jannik Peters

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…

Probability · Mathematics 2021-07-13 Steven Heilman

We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…

Computer Science and Game Theory · Computer Science 2019-04-19 Oren Dean , Yakov Babichenko , Moshe Tennenholtz

We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with their preferences), but where it is uncertain either which…

Computer Science and Game Theory · Computer Science 2016-03-27 Krzysztof Wojtas , Krzysztof Magiera , Tomasz Miąsko , Piotr Faliszewski

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

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

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

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting…

Multiagent Systems · Computer Science 2019-07-23 Wesley H. Holliday , Eric Pacuit

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

In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Jerome Lang , Tuomas Sandholm
‹ Prev 1 2 3 10 Next ›