English
Related papers

Related papers: ClipAudit: A Simple Risk-Limiting Post-Election Au…

200 papers

It is well known, by the Gibbard-Satterthwaite Theorem, that when there are more than two candidates, any non-dictatorial voting rule can be manipulated by untruthful voters. But how strong is the incentive to manipulate under different…

Computer Science and Game Theory · Computer Science 2026-02-27 Ratip Emin Berker , Vincent Conitzer , Eden Hartman , Jiayuan Liu , Caspar Oesterheld

Drawing a random sample of ballots to conduct a risk-limiting audit generally requires knowing how the ballots cast in an election are organized into groups, for instance, how many containers of ballots there are in all and how many ballots…

Applications · Statistics 2012-07-17 Jorge H. Banuelos , Philip B. Stark

ONEAudit provides more efficient risk-limiting audits than other extant methods when the voting system cannot report a cast-vote record linked to each cast card. It obviates the need for re-scanning; it is simpler and more efficient than…

Methodology · Statistics 2025-08-20 Jacob V Spertus , Amanda K Glazer , Philip B Stark

Card-level comparison risk-limiting audits (CLCAs) heretofore required a CVR for each cast card and a "link" identifying which CVR is for which card -- which many voting systems cannot provide. Every set of CVRs that produces the same…

Applications · Statistics 2023-06-21 Philip B. Stark

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 district-based multi-party elections, electors cast votes in their respective districts. In each district, the party with maximum votes wins the corresponding seat in the governing body. Election Surveys try to predict the election…

Methodology · Statistics 2023-12-27 Adway Mitra , Palash Dey

Plurality and approval voting are two well-known voting systems with different strengths and weaknesses. In this paper we consider a new voting system we call beta(k) which allows voters to select a single first-choice candidate and approve…

Theoretical Economics · Economics 2020-06-02 Peter Butler , Jerry Lin

A "repeat voting" procedure is proposed, whereby voting is carried out in two identical rounds. Every voter can vote in each round, the results of the first round are made public before the second round, and the final result is determined…

Theoretical Economics · Economics 2022-11-30 Sergiu Hart

How often will elections end in landslides? What is the probability for a head-to-head race? Analyzing ballot results from several large countries rather anomalous and yet unexplained distributions have been observed. We identify tactical…

Physics and Society · Physics 2010-09-17 Nuno A. M. Araújo , José S. Andrade , Hans J. Herrmann

We analyze Assessment Voting, a new two-round voting procedure that can be applied to binary decisions in democratic societies. In the first round, a randomly-selected number of citizens cast their vote on one of the two alternatives at…

Econometrics · Economics 2018-02-06 Hans Gersbach , Akaki Mamageishvili , Oriol Tejada

The traditional election control problem focuses on the use of control to promote a single candidate. In parliamentary elections, however, the focus shifts: voters care no less about the overall governing coalition than the individual…

Computer Science and Game Theory · Computer Science 2025-03-07 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

BRAVO, the most widely tried method for risk-limiting election audits, cannot accommodate sampling without replacement or stratified sampling, which can improve efficiency and may be required by law. It applies only to ballot-polling…

Methodology · Statistics 2022-08-15 Philip B. Stark

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

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

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

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…

Leaderboard scores on public benchmarks have been steadily rising and converging, with many frontier language models now separated by only marginal differences. However, these scores often fail to match users' day to day experience, because…

Artificial Intelligence · Computer Science 2026-02-05 Yiliang Song , Hongjun An , Jiangong Xiao , Haofei Zhao , Jiawei Shao , Xuelong Li

Limited Voting (LV) is an approval-based method for multi-winner elections where all ballots are required to have a same fixed size. While it appears to be used as voting method in corporate governance and has some political applications,…

Computer Science and Game Theory · Computer Science 2024-07-26 Maaike Venema-Los , Zoé Christoff , Davide Grossi

Let $V$ be a set of $n$ points in $\mathbb{R}^d$, called voters. A point $p\in \mathbb{R}^d$ is a plurality point for $V$ when the following holds: for every $q\in\mathbb{R}^d$ the number of voters closer to $p$ than to $q$ is at least the…

Computational Geometry · Computer Science 2020-05-19 Boris Aronov , Mark de Berg , Joachim Gudmundsson , Michael Horton

Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in…

Computer Science and Game Theory · Computer Science 2019-06-18 Edith Elkind , Jiarui Gan , Svetlana Obraztsova , Zinovi Rabinovich , Alexandros A. Voudouris