English
Related papers

Related papers: Fair votes in practice

200 papers

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

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

Proportional representation (PR) is often discussed in voting settings as a major desideratum. For the past century or so, it is common both in practice and in the academic literature to jump to single transferable vote (STV) as the…

Computer Science and Game Theory · Computer Science 2018-06-05 Haris Aziz , Barton Lee

In many proportional parliamentary elections, electoral thresholds (typically 3-5%) are used to promote stability and governability by preventing the election of parties with very small representation. However, these thresholds often result…

Computer Science and Game Theory · Computer Science 2025-03-24 Théo Delemazure , Rupert Freeman , Jérôme Lang , Jean-François Laslier , Dominik Peters

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

The voting systems known as Alternative Vote (AV) and Single Transferable Vote (STV) are extensively used for elections in Australia, possibly more than in any other jurisdiction. Often proposed as superior alternatives to Plurality and…

Physics and Society · Physics 2025-07-22 Anthony B. Morton

Ranked Choice Voting (RCV) and Single Transferable Voting (STV) are widely valued; but are complex to understand due to intricate per-round vote transfers. Questions like determining how far a candidate is from winning or identifying…

Computer Science and Game Theory · Computer Science 2024-07-22 Sanyukta Deshpande , Nikhil Garg , Sheldon Jacobson

Proportional representation (PR) is one of the central principles in voting. Elegant rules with compelling PR axiomatic properties have the potential to be adopted for several important collective decision making settings. I survey some…

Computer Science and Game Theory · Computer Science 2018-02-06 Haris Aziz

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

The goal of this paper is to propose and study properties of multiwinner voting rules which can be consider as generalisations of single-winner scoring voting rules. We consider SNTV, Bloc, k-Borda, STV, and several variants of…

Computer Science and Game Theory · Computer Science 2015-06-10 Edith Elkind , Piotr Faliszewski , Piotr Skowron , Arkadii Slinko

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

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

We study the performance of voting mechanisms from a utilitarian standpoint, under the recently introduced framework of metric-distortion, offering new insights along three main lines. First, if $d$ represents the doubling dimension of the…

Computer Science and Game Theory · Computer Science 2022-03-25 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

American democracy is currently heavily reliant on plurality in single-member districts, or PSMD, as a system of election. But public perceptions of fairness are often keyed to partisan proportionality, or the degree of congruence between…

Computers and Society · Computer Science 2023-08-23 Moon Duchin , Gabe Schoenbach

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

Single Transferable Vote (STV) counting, used in several jurisdictions in Australia, is a system for choosing multiple election winners given voters' preferences among candidates. The system is complex and it is not always obvious how an…

Computers and Society · Computer Science 2025-09-18 Andrew Conway , Michelle Blom , Alexander Ek , Peter Stuckey , Vanessa Teague , Damjan Vukcevic

Every representative democracy must specify a mechanism under which voters choose their representatives. The most common mechanism in the United States -- Winner takes all single-member districts -- both enables substantial partisan…

Computer Science and Game Theory · Computer Science 2026-02-23 Nikhil Garg , Wes Gurnee , David Rothschild , David Shmoys

We visualize aggregate outputs of popular multiwinner voting rules--SNTV, STV, Bloc, k-Borda, Monroe, Chamberlin--Courant, and HarmonicBorda--for elections generated according to the two-dimensional Euclidean model. We consider three…

Computer Science and Game Theory · Computer Science 2019-01-29 Edith Elkind , Piotr Faliszewski , Jean-Francois Laslier , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

Computer Science and Game Theory · Computer Science 2025-09-24 Tomáš Masařík , Grzegorz Pierczyński , Piotr Skowron

We define several different thresholds for election methods by considering different scenarios, corresponding to different proportionality criteria that have been proposed by various authors. In particular, we reformulate the criteria known…

Computer Science and Game Theory · Computer Science 2018-10-16 Svante Janson
‹ Prev 1 2 3 10 Next ›