English
Related papers

Related papers: The Schulze Method of Voting

200 papers

Voting rules allow multiple agents to aggregate their preferences in order to reach joint decisions. Perhaps one of the most important desirable properties in this context is Condorcet-consistency, which requires that a voting rule should…

Computer Science and Game Theory · Computer Science 2016-02-26 Felix Brandt , Christian Geist , Dominik Peters

Approval-preferential voting is problematical since it combines two different kinds of information that could by themselves lead to different choices. This article analyses the problem and studies a new proposal to deal with it. The…

Computer Science and Game Theory · Computer Science 2021-01-12 Rosa Camps , Xavier Mora , Laia Saumell

Elections employ various voting systems to determine winners based on voters' preferences. However, many recent ranked-choice elections have forced voters to truncate their ballots by only ranking a subset of the candidates. This study…

Computers and Society · Computer Science 2023-11-14 Jonah Stein

Both Schulze and ranked pairs are voting rules that satisfy many natural, desirable axioms. Many standard types of electoral control (with a chair seeking to change the outcome of an election by interfering with the election structure) have…

Computer Science and Game Theory · Computer Science 2024-05-16 Cynthia Maushagen , David Niclaus , Paul Nüsken , Jörg Rothe , Tessa Seeger

We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…

Theoretical Economics · Economics 2022-05-25 Arash Abizadeh , Adrian Vetta

We present theoretical and empirical results demonstrating the usefulness of voting rules for participatory democracies. We first give algorithms which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule…

Multiagent Systems · Computer Science 2014-07-17 David Lee , Ashish Goel , Tanja Aitamurto , Helene Landemore

We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a total ordering of the candidates, each voter is associated…

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

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

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 introduce River, a novel Condorcet-consistent voting method that is based on pairwise majority margins and can be seen as a simplified variation of Tideman's Ranked Pairs method. River is simple to explain, simple to compute even 'by…

Computer Science and Game Theory · Computer Science 2025-04-22 Michelle Döring , Markus Brill , Jobst Heitzig

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

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

We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one…

Computer Science and Game Theory · Computer Science 2019-01-23 Grzegorz Pierczyński , Piotr Skowron

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…

Computer Science and Game Theory · Computer Science 2019-11-13 Martin Lackner , Piotr Skowron

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

Multiagent Systems · Computer Science 2020-03-02 Mohammad Ali Javidian , Pooyan Jamshidi , Marco Valtorta , Rasoul Ramezanian

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

Computer Science and Game Theory · Computer Science 2017-11-17 Haris Aziz , Barton E. Lee

The election methods introduced in 1894--1895 by Phragm\'en and Thiele, and their somewhat later versions for ordered (ranked) ballots, are discussed in detail. The paper includes definitions and examples and discussion of whether the…

History and Overview · Mathematics 2018-10-15 Svante Janson

We introduce BallotRank, a ranked preference aggregation method derived from a modified PageRank algorithm. It is a Condorcet-consistent method without damping, and empirical examination of nearly 2,000 ranked choice elections and over…

Computer Science and Game Theory · Computer Science 2026-01-22 Jason Douglas Todd , Ismar Volic

This paper introduces Propose or Vote (PoV), a democratic procedure for collective decision-making and elections that does not rely on a central mechanism designer. In the first stage, members of a polity choose whether to become…

Theoretical Economics · Economics 2025-12-23 Hans Gersbach

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