Analysing Vote Counting Algorithms via Logic
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.
KeywordsModel Checker Election Result Vote Scheme Proportional Representation Bound Model Checker
Unable to display preview. Download preview PDF.
- 1.Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Weiss, G. (ed.) Multiagent Systems. MIT Press (2012)Google Scholar
- 2.CADE Inc.: CADE Bylaws (effective November 1, 1996; amended July/August 2000), http://www.cadeinc.org/Bylaws.html (accessed January 20, 2013)
- 3.Cochran, D.: Formal Specification and Analysis of Danish and Irish Ballot Counting Algorithms. Ph.D. thesis, IT University of Copenhagen (2012)Google Scholar
- 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.Plaisted, D.A.: A consideration of the new CADE bylaws, http://www.cs.unc.edu/Research/mi/consideration.html (accessed January 20, 2013)
- 9.Wikipedia: Single transferable vote, http://en.wikipedia.org/wiki/Single_transferable_vote (accessed January 20, 2013)