RLAs for 2-Seat STV Elections: Revisited
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910723374841856 |
|---|---|
| author | Blom, Michelle Stuckey, Peter J. Teague, Vanessa Vukcevic, Damjan |
| author_facet | Blom, Michelle Stuckey, Peter J. Teague, Vanessa Vukcevic, Damjan |
| contents | Single Transferable Vote (STV) elections are a principled approach to electing multiple candidates in a single election. Each ballot has a starting value of 1, and a candidate is elected if they gather a total vote value more than a defined quota. Votes over the quota have their value reduced by a transfer value so as to remove the quota, and are passed to the next candidate on the ballot. Risk-limiting audits (RLAs) are a statistically sound approach to election auditing which guarantees that failure to detect an error in the result is bounded by a limit. A first approach to RLAs for 2-seat STV elections has been defined. In this paper we show how we can improve this approach by reasoning about lower bounds on transfer values, and how we can extend the approach to partially audit an election, if the method does not support a full audit. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_03707 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | RLAs for 2-Seat STV Elections: Revisited Blom, Michelle Stuckey, Peter J. Teague, Vanessa Vukcevic, Damjan Computer Science and Game Theory Single Transferable Vote (STV) elections are a principled approach to electing multiple candidates in a single election. Each ballot has a starting value of 1, and a candidate is elected if they gather a total vote value more than a defined quota. Votes over the quota have their value reduced by a transfer value so as to remove the quota, and are passed to the next candidate on the ballot. Risk-limiting audits (RLAs) are a statistically sound approach to election auditing which guarantees that failure to detect an error in the result is bounded by a limit. A first approach to RLAs for 2-seat STV elections has been defined. In this paper we show how we can improve this approach by reasoning about lower bounds on transfer values, and how we can extend the approach to partially audit an election, if the method does not support a full audit. |
| title | RLAs for 2-Seat STV Elections: Revisited |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2402.03707 |