Advertisement

Analysing Vote Counting Algorithms via Logic

And Its Application to the CADE Election Scheme
  • Bernhard Beckert
  • Rajeev Goré
  • Carsten Schürmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7898)

Abstract

We present a method for using first-order logic to specify the semantics of preferences as used in common vote counting algorithms. We also present a corresponding system that uses Celf linear-logic programs to describe voting algorithms and which generates explicit examples when the algorithm departs from its specification. When we applied our method and system to analyse the vote counting algorithm used for electing the CADE Board of Trustees, we found that it strictly differs from the standard definition of Single Transferable Vote (STV). We therefore argue that “STV” is a misnomer for the CADE algorithm.

Keywords

Model Checker Election Result Vote Scheme Proportional Representation Bound Model Checker 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Weiss, G. (ed.) Multiagent Systems. MIT Press (2012)Google Scholar
  2. 2.
    CADE Inc.: CADE Bylaws (effective November 1, 1996; amended July/August 2000), http://www.cadeinc.org/Bylaws.html (accessed January 20, 2013)
  3. 3.
    Cochran, D.: Formal Specification and Analysis of Danish and Irish Ballot Counting Algorithms. Ph.D. thesis, IT University of Copenhagen (2012)Google Scholar
  4. 4.
    DeYoung, H., Schürmann, C.: Linear logical voting protocols. In: Kiayias, A., Lipmaa, H. (eds.) VoteID 2011. LNCS, vol. 7187, pp. 53–70. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Farkas, D., Nitzan, S.: The Borda Rule and Pareto Stability: A comment. Econometrica 47(5), 1305–1306 (1979)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Logic and Computation Group at ANU: Formal methods applied to electronic voting systems, http://users.cecs.anu.edu.au/~rpg/EVoting/index.html (retrieved) (accessed January 20, 2013)
  7. 7.
    Plaisted, D.A.: A consideration of the new CADE bylaws, http://www.cs.unc.edu/Research/mi/consideration.html (accessed January 20, 2013)
  8. 8.
    Schack-Nielsen, A., Schürmann, C.: Celf: A logical framework for deductive and concurrent systems (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 320–326. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  9. 9.
    Wikipedia: Single transferable vote, http://en.wikipedia.org/wiki/Single_transferable_vote (accessed January 20, 2013)

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Bernhard Beckert
    • 1
  • Rajeev Goré
    • 2
  • Carsten Schürmann
    • 3
  1. 1.Karlsruhe Institute of TechnologyGermany
  2. 2.The Australian National UniversityAustralia
  3. 3.IT University of CopenhagenDenmark

Personalised recommendations