3+ Seat Risk-Limiting Audits for Single Transferable Vote Elections

📅 2025-03-19
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This paper addresses the challenge of risk-limiting audits (RLAs) for multi-winner single transferable vote (STV) elections with three or more seats—a problem for which no prior RLA framework exists. We propose the first assertion-based RLA framework for multi-seat STV, overcoming the limitation of existing methods that only apply to two-seat contests. Our approach models STV tabulation logic, generates auditable assertions, and integrates probabilistic bounds with statistical hypothesis testing to support both full and ballot-comparison partial audits. Empirical evaluation on over 500 Scottish local council elections (each electing three or four candidates) shows that while full-audit success rates decline with increasing seat count, partial audits reliably verify the correctness of most—or even all—elected candidates, strictly respecting the prescribed risk limit. The core contribution is a theoretical and practical breakthrough in multi-seat STV auditing, substantially improving audit feasibility and efficiency in high-seat scenarios.

Technology Category

Application Category

📝 Abstract
Constructing efficient risk-limiting audits (RLAs) for multiwinner single transferable vote (STV) elections is a challenging problem. An STV RLA is designed to statistically verify that the reported winners of an election did indeed win according to the voters' expressed preferences and not due to mistabulation or interference, while limiting the risk of accepting an incorrect outcome to a desired threshold (the risk limit). Existing methods have shown that it is possible to form RLAs for two-seat STV elections in the context where the first seat has been awarded to a candidate in the first round of tabulation. This is called the first winner criterion. We present an assertion-based approach to conducting full or partial RLAs for STV elections with three or more seats, in which the first winner criterion is satisfied. Although the chance of forming a full audit that verifies all winners drops substantially as the number of seats increases, we show that we can quite often form partial audits that verify most, and sometimes all, of the reported winners. We evaluate our method on a dataset of over 500 three- and four-seat STV elections from the 2017 and 2022 local council elections in Scotland.
Problem

Research questions and friction points this paper is trying to address.

Develop risk-limiting audits for multiwinner STV elections.
Verify election winners based on voter preferences accurately.
Enable partial audits for elections with three or more seats.
Innovation

Methods, ideas, or system contributions that make the work stand out.

Assertion-based RLA for multiwinner STV elections
Partial audits verify most reported winners
Evaluation on 500+ Scottish local council elections
🔎 Similar Papers
No similar papers found.
Michelle Blom
Michelle Blom
School of Computing and Information Systems, The University of Melbourne
OptimisationArtificial Intelligence
A
Alexander Ek
Department of Econometrics and Business Statistics, Monash University, Clayton, Australia
P
Peter J. Stuckey
Department of Data Science and AI, Monash University, Clayton, Australia
Vanessa Teague
Vanessa Teague
Thinking Cybersecurity and The Australian National University
electronic votingend-to-end verifiable votingcryptographysecurityprivacy
D
Damjan Vukcevic
Department of Econometrics and Business Statistics, Monash University, Clayton, Australia