English
Related papers

Related papers: Optimal Strategies in Ranked Choice Voting

200 papers

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

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

Ranked Choice Voting (RCV) adoption is expanding across U.S. elections, but faces persistent criticism for complexity, strategic manipulation, and ballot exhaustion. We empirically test these concerns on real election data, across three…

Computers and Society · Computer Science 2026-02-17 Sanyukta Deshpande , Nikhil Garg , Sheldon H. Jacobson

The single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections. Each ballot cast by a voter is a (potentially partial) ranking over a set of candidates. The margin of victory, or simply…

Computer Science and Game Theory · Computer Science 2025-03-26 Michelle Blom , Alexander Ek , Peter J. Stuckey , Vanessa Teague , Damjan Vukcevic

Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences. One barrier that might exist to such manipulation is computational…

Artificial Intelligence · Computer Science 2012-04-18 Toby Walsh

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 describe the vote package in R, which implements the plurality (or first-past-the-post), two-round runoff, score, approval and single transferable vote (STV) electoral systems, as well as methods for selecting the Condorcet winner and…

Computation · Statistics 2021-02-12 Adrian E. Raftery , Hana Ševčíková , Bernard W. Silverman

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

Today, Internet involves many actors who are making revenues on it (operators, companies, service providers,...). It is therefore important to be able to make fair decisions in this large-scale and highly competitive economical ecosystem.…

Networking and Internet Architecture · Computer Science 2012-05-01 François Durand , Fabien Mathieu , Ludovic Noirie

Criteria for a good voting system have been given particularly careful scrutiny in recent years, with general agreement that the core values are fair results, voter power and choice, and local representation. This paper reexamines the basic…

Physics and Society · Physics 2023-03-29 Denis Mollison

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…

To help their users to discover important items at a particular time, major websites like Twitter, Yelp, TripAdvisor or NYTimes provide Top-K recommendations (e.g., 10 Trending Topics, Top 5 Hotels in Paris or 10 Most Viewed News Stories),…

Social and Information Networks · Computer Science 2018-11-22 Abhijnan Chakraborty , Gourab K Patro , Niloy Ganguly , Krishna P. Gummadi , Patrick Loiseau

Proportional representation plays a crucial role in electoral systems. In ordinal elections, where voters rank candidates based on their preferences, the Single Transferable Vote (STV) is the most widely used proportional voting method. STV…

Computer Science and Game Theory · Computer Science 2025-05-02 Tuva Bardal , Markus Brill , David McCune , Jannik Peters

For many voting rules, it is NP-hard to compute a successful manipulation. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. We study empirically…

Artificial Intelligence · Computer Science 2012-04-18 Toby Walsh

Errors are inevitable in the implementation of any complex process. Here we examine the effect of random errors on Single Transferable Vote (STV) elections, a common approach to deciding multi-seat elections. It is usually expected that…

Computers and Society · Computer Science 2020-11-10 Michelle Blom , Andrew Conway , Peter J. Stuckey , Vanessa Teague , Damjan Vukcevic

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

Single Transferable Vote (STV) elections are a principled approach to electing multiple candidates in a single election. Each ballot has a starting value of 1, and a candidate is elected if they gather a total vote value more than a defined…

Computer Science and Game Theory · Computer Science 2024-12-03 Michelle Blom , Peter J. Stuckey , Vanessa Teague , Damjan Vukcevic

Approval-like voting rules, such as Sincere-Strategy Preference-Based Approval voting (SP-AV), the Bucklin rule (an adaptive variant of $k$-Approval voting), and the Fallback rule (an adaptive variant of SP-AV) have many desirable…

Computer Science and Game Theory · Computer Science 2015-01-05 Ildikó Schlotter , Piotr Faliszewski , Edith Elkind

Risk-limiting audits (RLAs) are an increasingly important method for checking that the reported outcome of an election is, in fact, correct. Indeed, their use is increasingly being legislated. While effective methods for RLAs have been…

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

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