English
Related papers

Related papers: Auditing Hamiltonian Elections

200 papers

Risk-limiting audits (RLAs) are a significant tool in increasing confidence in the accuracy of elections. They consist of randomized algorithms which check that an election's vote tally, as reported by a vote tabulation system, corresponds…

Computers and Society · Computer Science 2023-05-09 Bar Karov , Moni Naor

A collection of races in a single election can be audited as a group by auditing a random sample of batches of ballots and combining observed discrepancies in the races represented in those batches in a particular way: the maximum…

Applications · Statistics 2009-05-12 Philip B. Stark

We examine how six search engines filter and rank information in relation to the queries on the U.S. 2020 presidential primary elections under the default - that is nonpersonalized - conditions. For that, we utilize an algorithmic auditing…

Computers and Society · Computer Science 2021-05-04 Aleksandra Urman , Mykola Makhortykh , Roberto Ulloa

There are many sources of error in counting votes: the apparent winner might not be the rightful winner. Hand tallies of the votes in a random sample of precincts can be used to test the hypothesis that a full manual recount would find a…

Applications · Statistics 2008-07-28 Philip B. Stark

We present an approximate sampling framework and discuss how risk-limiting audits can compensate for these approximations, while maintaining their "risk-limiting" properties. Our framework is general and can compensate for counting mistakes…

Data Structures and Algorithms · Computer Science 2019-01-04 Mayuri Sridhar , Ronald L. Rivest

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…

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

Computer Science and Game Theory · Computer Science 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

How can we probabilistically predict the winner in a ranked-choice election without all ballots being counted? In this study, we introduce a novel algorithm designed to predict outcomes in Instant Runoff Voting (IRV) elections. The…

Computers and Society · Computer Science 2024-05-16 Nicholas Kapoor , P. Christopher Staecker

Tabulation audits for an election provide statistical evidence that a reported contest outcome is "correct" (meaning that the tabulation of votes was properly performed), or else the tabulation audit determines the correct outcome. Stark…

Cryptography and Security · Computer Science 2018-02-13 Ronald L. Rivest

Risk-limiting audits (RLAs) are techniques for verifying the outcomes of large elections. While they provide rigorous guarantees of correctness, widespread adoption has been impeded by both efficiency concerns and the fact they offer…

Cryptography and Security · Computer Science 2024-06-19 Benjamin Fuller , Rashmi Pai , Alexander Russell

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

U.S. presidential elections are decided by the Electoral College, established in 1789, and designed to mitigate potential risks arising from the collusion of large groups of citizens. A statewide winner-take-all popular voting system for…

Physics and Society · Physics 2024-10-02 Carlos Cardonha , David Bergman , Andre Cire , Leonardo Lozano , Tallys Yunes

A {\em leader election} algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1. In this paper the biased…

Data Structures and Algorithms · Computer Science 2007-05-23 Hanene Mohamed

In this paper, a new method of detection of election fraud is proposed. This method is based on the calculation of the ratio of two standard normal random variables; estimation of parameters of obtained sample and comparison of these…

Methodology · Statistics 2022-09-20 Ivan H. Krykun

A central feature of many deliberative processes, such as citizens' assemblies and deliberative polls, is the opportunity for participants to engage directly with experts. While participants are typically invited to propose questions for…

Artificial Intelligence · Computer Science 2026-04-28 Soham De , Lodewijk Gelauff , Ashish Goel , Smitha Milli , Ariel Procaccia , Alice Siu

In parliamentary elections, parties compete for a limited, typically fixed number of seats. Most parliaments are assembled using apportionment methods that distribute the seats based on the parties' vote counts. Common apportionment methods…

Issue salience is a major determinant in voters' decisions. Candidates and political parties campaign to shift salience to their advantage - a process termed priming. We study the dynamics, strategies and equilibria of campaign spending for…

Computer Science and Game Theory · Computer Science 2024-12-30 Jonathan Shaki , Yonatan Aumann , Sarit Kraus

This article analyses three methods of remote voting in an uncontrolled environment: postal voting, internet voting and hybrid voting. It breaks down the voting process into different stages and compares their vulnerabilities considering…

Computers and Society · Computer Science 2009-08-10 Chantal Enguehard , Rémi Lehn

This paper presents DiffSum, a simple post-election risk-limiting ballot-polling audit for two-candidate plurality elections. DiffSum sequentially draws ballots (without replacement) until the numbers $a$, $b$, of votes for candidates $A$,…

Computers and Society · Computer Science 2015-09-02 Ronald L. Rivest