Risk-Limiting Audits for Condorcet Elections
- URL: http://arxiv.org/abs/2303.10509v2
- Date: Wed, 19 Apr 2023 23:39:24 GMT
- Title: Risk-Limiting Audits for Condorcet Elections
- Authors: Michelle Blom, Peter J. Stuckey, Vanessa Teague, Damjan Vukcevic
- Abstract summary: We show how we can efficiently audit Condorcet elections for a number of variations.
We also compare the audit efficiency (how many ballots we expect to sample) of IRV and Condorcet elections.
- Score: 27.102139020324678
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Elections where electors rank the candidates (or a subset of the candidates)
in order of preference allow the collection of more information about the
electors' intent. The most widely used election of this type is Instant-Runoff
Voting (IRV), where candidates are eliminated one by one, until a single
candidate holds the majority of the remaining ballots. Condorcet elections
treat the election as a set of simultaneous decisions about each pair of
candidates. The Condorcet winner is the candidate who beats all others in these
pairwise contests. There are various proposals to determine a winner if no
Condorcet winner exists. In this paper we show how we can efficiently audit
Condorcet elections for a number of variations. We also compare the audit
efficiency (how many ballots we expect to sample) of IRV and Condorcet
elections.
Related papers
- Idiosyncratic properties of Australian STV election counting [52.669205232251585]
Single Transferable Vote (STV) counting is used in several jurisdictions in Australia.
This paper shows some of the unintuitive properties of some of these systems.
arXiv Detail & Related papers (2024-09-18T01:19:27Z) - Improving the Computational Efficiency of Adaptive Audits of IRV Elections [54.427049258408424]
AWAIRE can audit IRV contests with any number of candidates, but the original implementation incurred memory and computation costs that grew superexponentially with the number of candidates.
This paper improves the algorithmic implementation of AWAIRE in three ways that make it practical to audit IRV contests with 55 candidates, compared to the previous 6 candidates.
arXiv Detail & Related papers (2024-07-23T13:28:00Z) - Adaptively Weighted Audits of Instant-Runoff Voting Elections: AWAIRE [61.872917066847855]
Methods for auditing instant-runoff voting (IRV) elections are either not risk-limiting or require cast vote records (CVRs), the voting system's electronic record of the votes on each ballot.
We develop an RLA method that uses adaptively weighted averages of test supermartingales to efficiently audit IRV elections when CVRs are not available.
arXiv Detail & Related papers (2023-07-20T15:55:34Z) - Ranked Choice Voting And Condorcet Failure in the Alaska 2022 Special Election: How Might Other Voting Systems Compare? [0.0]
The August 2022 special election for the U.S. House of Representatives in Alaska featured three main candidates.
Results of this election displayed a well-known but relatively rare phenomenon known as "Condorcet failure:"
We use the data in the Cast Vote Record to explore the range of likely outcomes if this election had been conducted under two alternative voting systems.
arXiv Detail & Related papers (2023-02-28T22:14:50Z) - Identifying Possible Winners in Ranked Choice Voting Elections with
Outstanding Ballots [0.0]
ranked-choice voting (RCV) allows voters to rank their choices, and the results are computed in rounds.
RCV election outcomes are not always apparent on election night, and can take several weeks to be published.
We present an algorithm for efficiently computing possible winners of RCV elections from partially known ballots.
arXiv Detail & Related papers (2022-06-25T22:08:15Z) - Expected Frequency Matrices of Elections: Computation, Geometry, and
Preference Learning [58.23459346724491]
We use the "map of elections" approach of Szufa et al. (AAMAS 2020) to analyze several well-known vote distributions.
We draw the "skeleton map" of distributions, evaluate its robustness, and analyze its properties.
arXiv Detail & Related papers (2022-05-16T17:40:22Z) - Exploring Fairness in District-based Multi-party Elections under
different Voting Rules using Stochastic Simulations [0.5076419064097732]
Many democratic societies use district-based elections, where the region under consideration is geographically divided into districts and a representative is chosen for each district based on the preferences of the electors who reside there.
We show that this can lead to situations where many electors are dissatisfied with the election results, which is not desirable in a democracy.
Inspired by current literature on fairness of Machine Learning algorithms, we define measures of fairness to quantify the satisfaction of electors, irrespective of their political choices.
arXiv Detail & Related papers (2022-02-25T18:03:03Z) - Online Approval Committee Elections [20.217228946041168]
We show how to compute committees with maximal expected score.
We assume $k$ candidates need to be selected. The candidates appear over time. Each time one appears, it must be immediately selected or rejected.
arXiv Detail & Related papers (2022-02-14T16:06:47Z) - Bribery as a Measure of Candidate Success: Complexity Results for
Approval-Based Multiwinner Rules [58.8640284079665]
We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve)
We consider a number of approval-based multiwinner rules (AV, SAV, GAV, RAV, approval-based Chamberlin--Courant, and PAV)
In general, our problems tend to be easier when we limit out bribery actions on increasing the number of approvals of the candidate that we want to be in a winning committee.
arXiv Detail & Related papers (2021-04-19T08:26:40Z) - Auditing Hamiltonian Elections [24.832413743954618]
We show how to conduct risk-limiting audits for delegate allocation elections using variants of the Hamilton method.
Experiments on real-world elections show that we can audit primary elections to high confidence (small risk limits) usually at low cost.
arXiv Detail & Related papers (2021-02-17T00:20:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.