Risk-limiting Audits for Nonplurality Elections
By Anand Sarwate, Stephen Checkoway, and Hovav Shacham.
Technical Report CS2011-0967, UC San Diego, June 2011.
Abstract
Many organizations have turned to alternative voting systems such as instant-runoff voting for determining the outcome of single-winner elections. It is our position in this paper that the increasing deployment of such alternative systems necessitate the study and development of risk-limiting audits for these systems. We initiate this study.
We examine several commonly used single-winner voting systems and provide risk-limiting auditing procedures for them. In many cases the methods from auditing plurality contests can be applied with minor changes and little loss in efficiency. For instant-runoff voting (IRV), the situation is markedly different. We describe an algorithm for auditing the candidate elimination order using plurality methods which is risk-limiting. Standard risk-limiting methods can be employed if the margin of the election can be efficiently calculated or bounded. We provide efficiently computable upper and lower bounds on the margin and, when known, compare them to the exact margins. Both auditing algorithms are potentially far less efficient than the methods to audit other types of voting systems.
Material
- Technical report version.
- Full version, local copy, updated 2011-06-19 in PDF and PS.
- Most of the data and code used in the paper is on github.
Reference
@Techreport{sarwate-checkoway-shacham:nonplurality:ucsd11,
author = {Anand Sarwate and Stephen Checkoway and Hovav Shacham},
title = {Risk-limiting Audits for Nonplurality Elections},
institution = {UC San Diego},
number = {CS2011-0967},
year = 2011,
month = jun,
url = {https://checkoway.net/papers/nonplurality2011},
}