Sharper p-Values for Stratified Election Audits
Vote-tabulation audits can be used to collect evidence that the set of winners of an election (the outcome) according to the machine count is correct — that it agrees with the outcome that a full hand count of the audit trail would show. The strength of evidence is measured by the p-value of the hyp...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Walter de Gruyter & Co.
2019
|
Online Access: | https://hdl.handle.net/1721.1/122920 |
_version_ | 1811080877708410880 |
---|---|
author | Higgins, Michael J. Rivest, Ronald L Stark, Philip B. |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Higgins, Michael J. Rivest, Ronald L Stark, Philip B. |
author_sort | Higgins, Michael J. |
collection | MIT |
description | Vote-tabulation audits can be used to collect evidence that the set of winners of an election (the outcome) according to the machine count is correct — that it agrees with the outcome that a full hand count of the audit trail would show. The strength of evidence is measured by the p-value of the hypothesis that the machine outcome is wrong. Smaller p-values are stronger evidence that the outcome is correct. Most states that have election audits of any kind require audit samples stratified by county for contests that cross county lines. Previous work on p-values for stratified samples based on the largest weighted overstatement of the margin used upper bounds that can be quite weak. Sharper p-values can be found by solving a 0-1 knapsack problem. For example, the 2006 U.S. Senate race in Minnesota was audited using a stratified sample of 2–8 precincts from each of 87 counties, 202 precincts in all. Earlier work (Stark 2008b) found that the p-value was no larger than 0.042. We show that it is no larger than 0.016: much stronger evidence that the machine outcome was correct. We also give algorithms for choosing how many batches to draw from each stratum to reduce the counting burden. In the 2006 Minnesota race, a stratified sample about half as large — 109 precincts versus 202 — would have given just as small a p-value if the observed maximum overstatement were the same. This would require drawing 11 precincts instead of 8 from the largest county, and 1 instead of 2 from the smallest counties. We give analogous results for the 2008 U.S. House of Representatives contests in California. Keywords: post-election audits; knapsack problem |
first_indexed | 2024-09-23T11:38:18Z |
format | Article |
id | mit-1721.1/122920 |
institution | Massachusetts Institute of Technology |
language | English |
last_indexed | 2024-09-23T11:38:18Z |
publishDate | 2019 |
publisher | Walter de Gruyter & Co. |
record_format | dspace |
spelling | mit-1721.1/1229202022-10-01T04:58:22Z Sharper p-Values for Stratified Election Audits Higgins, Michael J. Rivest, Ronald L Stark, Philip B. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Vote-tabulation audits can be used to collect evidence that the set of winners of an election (the outcome) according to the machine count is correct — that it agrees with the outcome that a full hand count of the audit trail would show. The strength of evidence is measured by the p-value of the hypothesis that the machine outcome is wrong. Smaller p-values are stronger evidence that the outcome is correct. Most states that have election audits of any kind require audit samples stratified by county for contests that cross county lines. Previous work on p-values for stratified samples based on the largest weighted overstatement of the margin used upper bounds that can be quite weak. Sharper p-values can be found by solving a 0-1 knapsack problem. For example, the 2006 U.S. Senate race in Minnesota was audited using a stratified sample of 2–8 precincts from each of 87 counties, 202 precincts in all. Earlier work (Stark 2008b) found that the p-value was no larger than 0.042. We show that it is no larger than 0.016: much stronger evidence that the machine outcome was correct. We also give algorithms for choosing how many batches to draw from each stratum to reduce the counting burden. In the 2006 Minnesota race, a stratified sample about half as large — 109 precincts versus 202 — would have given just as small a p-value if the observed maximum overstatement were the same. This would require drawing 11 precincts instead of 8 from the largest county, and 1 instead of 2 from the smallest counties. We give analogous results for the 2008 U.S. House of Representatives contests in California. Keywords: post-election audits; knapsack problem 2019-11-12T19:04:31Z 2019-11-12T19:04:31Z 2011-10 2019-07-03T13:59:45Z Article http://purl.org/eprint/type/JournalArticle 2151-7509 2194-6299 https://hdl.handle.net/1721.1/122920 Higgins, Michael J., Ronald L. Rivest and Philip B. Stark. "Sharper p-Values for Stratified Election Audits." Statistics, Politics, and Policy, 2.1 (2011). en 10.2202/2151-7509.1031 Statistics, Politics and Policy Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Walter de Gruyter & Co. MIT web domain |
spellingShingle | Higgins, Michael J. Rivest, Ronald L Stark, Philip B. Sharper p-Values for Stratified Election Audits |
title | Sharper p-Values for Stratified Election Audits |
title_full | Sharper p-Values for Stratified Election Audits |
title_fullStr | Sharper p-Values for Stratified Election Audits |
title_full_unstemmed | Sharper p-Values for Stratified Election Audits |
title_short | Sharper p-Values for Stratified Election Audits |
title_sort | sharper p values for stratified election audits |
url | https://hdl.handle.net/1721.1/122920 |
work_keys_str_mv | AT higginsmichaelj sharperpvaluesforstratifiedelectionaudits AT rivestronaldl sharperpvaluesforstratifiedelectionaudits AT starkphilipb sharperpvaluesforstratifiedelectionaudits |