Analysing Vote Counting Algorithms Via Logic - And its Application  to the CADE Election Scheme

Carsten Schürmann; Bernhard Beckert; Rejeev Gore

doi:10.1007/978-3-642-38574-2_9

Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme

Carsten Schürmann, Bernhard Beckert, Rejeev Gore

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

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.

Original language	English
Title of host publication	Automated Deduction – CADE-24 : Proceedings of the 16th International Conference on Automated Deduction (CADE-24)
Publisher	Springer
Publication date	2013
Pages	135-144
ISBN (Print)	978-3-642-38573-5
ISBN (Electronic)	978-3-642-38574-2
DOIs	https://doi.org/10.1007/978-3-642-38574-2_9
Publication status	Published - 2013
Event	The 24th International Conference on Automated Deduction - Lake Placid, NY, USA, United States Duration: 9 Jun 2013 → 14 Jun 2013 http://www.cl.cam.ac.uk/~gp351/cade24/

Conference

Conference	The 24th International Conference on Automated Deduction
Country/Territory	United States
City	Lake Placid, NY, USA
Period	09/06/2013 → 14/06/2013
Internet address	http://www.cl.cam.ac.uk/~gp351/cade24/

Series	Lecture Notes in Computer Science
Volume	7898
ISSN	0302-9743

Keywords

First-order logic
Vote counting algorithms
Linear-logic programs
Single Transferable Vote (STV)
CADE Board of Trustees

Access to Document

10.1007/978-3-642-38574-2_9

Cite this

@inproceedings{26478c027cf549fdbdc7ae6fc28388f1,

title = "Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme",

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 = "First-order logic, Vote counting algorithms, Linear-logic programs, Single Transferable Vote (STV), CADE Board of Trustees, First-order logic, Vote counting algorithms, Linear-logic programs, Single Transferable Vote (STV), CADE Board of Trustees",

author = "Carsten Sch{\"u}rmann and Bernhard Beckert and Rejeev Gore",

year = "2013",

doi = "10.1007/978-3-642-38574-2_9",

language = "English",

isbn = "978-3-642-38573-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "135--144",

booktitle = "Automated Deduction – CADE-24",

address = "Germany",

note = "The 24th International Conference on Automated Deduction, CADE 24 ; Conference date: 09-06-2013 Through 14-06-2013",

url = "http://www.cl.cam.ac.uk/~gp351/cade24/",

}

Schürmann, C, Beckert, B & Gore, R 2013, Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme. in Automated Deduction – CADE-24: Proceedings of the 16th International Conference on Automated Deduction (CADE-24). Springer, Lecture Notes in Computer Science, vol. 7898, pp. 135-144, The 24th International Conference on Automated Deduction, Lake Placid, NY, USA, United States, 09/06/2013. https://doi.org/10.1007/978-3-642-38574-2_9

Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme. / Schürmann, Carsten; Beckert, Bernhard; Gore, Rejeev.
Automated Deduction – CADE-24: Proceedings of the 16th International Conference on Automated Deduction (CADE-24). Springer, 2013. p. 135-144 (Lecture Notes in Computer Science, Vol. 7898).

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

TY - GEN

T1 - Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme

AU - Schürmann, Carsten

AU - Beckert, Bernhard

AU - Gore, Rejeev

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - First-order logic

KW - Vote counting algorithms

KW - Linear-logic programs

KW - Single Transferable Vote (STV)

KW - CADE Board of Trustees

KW - First-order logic

KW - Vote counting algorithms

KW - Linear-logic programs

KW - Single Transferable Vote (STV)

KW - CADE Board of Trustees

U2 - 10.1007/978-3-642-38574-2_9

DO - 10.1007/978-3-642-38574-2_9

M3 - Article in proceedings

SN - 978-3-642-38573-5

T3 - Lecture Notes in Computer Science

SP - 135

EP - 144

BT - Automated Deduction – CADE-24

PB - Springer

T2 - The 24th International Conference on Automated Deduction

Y2 - 9 June 2013 through 14 June 2013

ER -