Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-38574-2_9 | CADE |
Keywords | DocType | Citations |
algorithm departs,corresponding system,cade election scheme,standard definition,explicit example,celf linear-logic program,common vote,cade board,first-order logic,cade algorithm,analysing vote,single transferable vote | Conference | 1 |
PageRank | References | Authors |
0.40 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernhard Beckert | 1 | 862 | 86.50 |
| Rajeev Goré | 2 | 641 | 63.45 |
| Carsten Schürmann | 3 | 625 | 49.63 |