Auditing Ranked Voting Elections with Dirichlet-Tree Models: First Steps
| dc.contributor.author | Everest, Floyd | |
| dc.contributor.author | Blom, Michelle | |
| dc.contributor.author | B. Stark, Philip | |
| dc.contributor.author | Stuckey, Peter J. | |
| dc.contributor.author | Teague, Vanessa | |
| dc.contributor.author | Vukcevic, Damjan | |
| dc.date.accessioned | 2022-09-29T07:10:33Z | |
| dc.date.available | 2022-09-29T07:10:33Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | Ranked voting systems, such as instant-runo voting (IRV) and single transferable vote (STV), are used in many places around the world. They are more complex than plurality and scoring rules, pre- senting a challenge for auditing their outcomes: there is no known risk- limiting audit (RLA) method for STV other than a full hand count. We present a new approach to auditing ranked systems that uses a sta- tistical model, a Dirichlet-tree, that can cope with high-dimensional pa- rameters in a computationally e cient manner. We demonstrate this ap- proach with a ballot-polling Bayesian audit for IRV elections. Although the technique is not known to be risk-limiting, we suggest some strategies that might allow it to be calibrated to limit risk. | et |
| dc.identifier.uri | http://hdl.handle.net/10062/84319 | |
| dc.identifier.uri | https://doi.org/10.15157/diss/021 | |
| dc.language.iso | eng | et |
| dc.relation | info:eu-repo/grantAgreement/EC/H2020/857622///ECePS | et |
| dc.rights | info:eu-repo/semantics/openAccess | et |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | Auditing | et |
| dc.subject | Instant-Runoff Voting | et |
| dc.subject | Risk-Limiting Audit | et |
| dc.title | Auditing Ranked Voting Elections with Dirichlet-Tree Models: First Steps | et |
| dc.type | info:eu-repo/semantics/article | et |