English
Related papers

Related papers: Risk-Limiting Audits for Condorcet Elections

200 papers

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…

Artificial Intelligence · Computer Science 2012-03-15 Nina Narodytska , Toby Walsh , Lirong Xia

We study a mathematical model of voting contest with $m$ voters and $n$ candidates, with each voter ranking the candidates in order of preference, without ties. A Condorcet winner is a candidate who gets more than $m/2$ votes in pairwise…

Combinatorics · Mathematics 2025-11-05 Boris Pittel

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

The margin of victory is easy to compute for many election schemes but difficult for Instant Runoff Voting (IRV). This is important because arguments about the correctness of an election outcome usually rely on the size of the electoral…

Artificial Intelligence · Computer Science 2015-08-21 Michelle Blom , Peter J. Stuckey , Vanessa J. Teague , Ron Tidhar

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

AWAIRE is one of two extant methods for conducting risk-limiting audits of instant-runoff voting (IRV) elections. In principle AWAIRE can audit IRV contests with any number of candidates, but the original implementation incurred memory and…

Computers and Society · Computer Science 2024-09-24 Alexander Ek , Michelle Blom , Philip B. Stark , Peter J. Stuckey , Damjan Vukcevic

Previous studies have shown that Instant-Runoff Voting (IRV) is highly resistant to coalitional manipulation (CM), though the theoretical reasons for this remain unclear. To address this gap, we analyze the susceptibility to CM of three…

Computer Science and Game Theory · Computer Science 2025-10-17 François Durand

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington

In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…

Computer Science and Game Theory · Computer Science 2026-04-23 Itai Zilberstein , Ratip Emin Berker , George Li , Ruben Martins

A Condorcet cycle election is an election (often called a Social Welfare Function, or SWF) between three candidates, where each voter ranks the three candidates according to a fixed cyclic order. Maskin showed that if such a SWF obeys the…

Combinatorics · Mathematics 2025-11-05 Gabriel Gendler

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

The City and County of San Francisco, CA, has used Instant Runoff Voting (IRV) for some elections since 2004. This report describes the first ever process pilot of Risk Limiting Audits for IRV, for the San Francisco District Attorney's race…

Computers and Society · Computer Science 2020-04-02 Michelle Blom , Andrew Conway , Dan King , Laurent Sandrolini , Philip B. Stark , Peter J. Stuckey , Vanessa Teague

Conflict of interest is the permanent companion of any population of agents (computational or biological). For that reason, the ability to compromise is of paramount importance, making voting a key element of societal mechanisms. One of the…

Artificial Intelligence · Computer Science 2016-08-10 Arne Recknagel , Tarek R. Besold

The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increases to infinity. We study this result under an asymmetric…

Computer Science and Game Theory · Computer Science 2024-08-02 Ganesh Ghalme , Reshef Meir

An election audit is risk-limiting if the audit limits (to a pre-specified threshold) the chance that an erroneous electoral outcome will be certified. Extant methods for auditing instant-runoff voting (IRV) elections are either not…

Applications · Statistics 2023-10-06 Alexander Ek , Philip B. Stark , Peter J. Stuckey , Damjan Vukcevic

We consider synchronous iterative voting, where voters are given the opportunity to strategically choose their ballots depending on the outcome deduced from the previous collective choices.We propose two settings for synchronous iterative…

Computer Science and Game Theory · Computer Science 2022-02-11 Benoît Kloeckner

We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix). We show that counting elections that generate a given…

Computer Science and Game Theory · Computer Science 2023-03-10 Niclas Boehmer , Jin-Yi Cai , Piotr Faliszewski , Austen Z. Fan , Łukasz Janeczko , Andrzej Kaczmarczyk , Tomasz Wąs

Much research in electoral control -- one of the most studied form of electoral attacks, in which an entity running an election alters the structure of that election to yield a preferred outcome -- has focused on giving decision complexity…

Computer Science and Game Theory · Computer Science 2026-05-14 Huy Vu Bui , Michael C. Chavrimootoo , Kien T. Le , Son M. Nguyen

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

We analyze how frequently instant runoff voting (IRV) selects the weakest (or least popular) candidate in three-candidate elections. We consider four definitions of ``weakest candidate'': the Borda loser, the Bucklin loser, the candidate…

General Economics · Economics 2026-02-26 David McCune , Jennifer Wilson