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

Carsten Schürmann, Bernhard Beckert, Rejeev Gore

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer 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.
OriginalsprogEngelsk
TitelAutomated Deduction – CADE-24 : Proceedings of the 16th International Conference on Automated Deduction (CADE-24)
ForlagSpringer
Publikationsdato2013
Sider135-144
ISBN (Trykt)978-3-642-38573-5
ISBN (Elektronisk)978-3-642-38574-2
DOI
StatusUdgivet - 2013
BegivenhedThe 24th International Conference on Automated Deduction - Lake Placid, NY, USA, USA
Varighed: 9 jun. 201314 jun. 2013
http://www.cl.cam.ac.uk/~gp351/cade24/

Konference

KonferenceThe 24th International Conference on Automated Deduction
Land/OmrådeUSA
ByLake Placid, NY, USA
Periode09/06/201314/06/2013
Internetadresse
NavnLecture Notes in Computer Science
Vol/bind7898
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme'. Sammen danner de et unikt fingeraftryk.

Citationsformater