Skip to main content

Risk-Limiting Audits for Condorcet Elections

  • Conference paper
  • First Online:
Financial Cryptography and Data Security. FC 2023 International Workshops (FC 2023)

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.

This work was supported by the University of Melbourne’s Research Computing Services and the Petascale Campus Initiative; and by the Australian Research Council (Discovery Project DP220101012; OPTIMA ITTC IC200100009).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    www.preflib.org, accessed 14 Mar 2023.

  2. 2.

    Ties are also possible, but very rare for elections with many ballots.

  3. 3.

    https://en.wikipedia.org/wiki/Minimax_Condorcet_method, accessed 14 Mar 2023.

  4. 4.

    https://en.wikipedia.org/wiki/Smith_set, accessed 14 Mar 2023.

References

  1. Blom, M., et al.: Assertion-based approaches to auditing complex elections, with application to party-list proportional elections. In: Krimmer, R., et al. (eds.) E-Vote-ID 2021. LNCS, vol. 12900, pp. 47–62. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-86942-7_4, Preprint: https://arxiv.org/abs/2107.11903arXiv:2107.11903

  2. Blom, M., Stuckey, P.J., Teague, V.: RAIRE: risk-limiting audits for IRV elections (2019). https://arxiv.org/abs/1903.08804arXiv:1903.08804

  3. Stark, P.B.: Sets of half-average nulls generate risk-limiting audits: SHANGRLA. In: Bernhard, M., et al. (eds.) FC 2020. LNCS, vol. 12063, pp. 319–336. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-54455-3_23, Preprint: https://arxiv.org/abs/1911.10035arXiv:1911.10035

  4. Tideman, T.N.: Independence of clones as a criterion for voting rules. Soc. Choice Welf. 4(3), 185–206 (1987)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michelle Blom .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 International Financial Cryptography Association

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Blom, M., Stuckey, P.J., Teague, V., Vukcevic, D. (2024). Risk-Limiting Audits for Condorcet Elections. In: Essex, A., et al. Financial Cryptography and Data Security. FC 2023 International Workshops. FC 2023. Lecture Notes in Computer Science, vol 13953. Springer, Cham. https://doi.org/10.1007/978-3-031-48806-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-48806-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-48805-4

  • Online ISBN: 978-3-031-48806-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics