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.
Lecture Notes in Computer Science: Proceedings of the 16th International Conference on Automated Deduction (cade-24), 2013, p. 135-144
Main Research Area:
Lecture Notes in Computer Science
The 24th International Conference on Automated DeductionInternational Conference on Automated Deduction, 2013