International Conference on Algorithmic DecisionTheory

ADT 2015: Algorithmic Decision Theory pp 253-269

Democratix: A Declarative Approach to Winner Determination

Conference paper

DOI: 10.1007/978-3-319-23114-3_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9346)
Cite this paper as:
Charwat G., Pfandler A. (2015) Democratix: A Declarative Approach to Winner Determination. In: Walsh T. (eds) Algorithmic Decision Theory. ADT 2015. Lecture Notes in Computer Science, vol 9346. Springer, Cham

Abstract

Computing the winners of an election is an important task in voting and preference aggregation. The declarative nature of answer-set programming (ASP) and the performance of state-of-the-art solvers render ASP very well-suited to tackle this problem. In this work we present a novel, reduction-based approach for a variety of voting rules, ranging from tractable cases to problems harder than NP. The encoded voting rules are put together in the extensible tool Democratix, which handles the computation of winners and is also available as a web application. To learn more about the capabilities and limits of the approach, the encodings are evaluated thoroughly on real-world data as well as on random instances.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute of Information SystemsTU WienViennaAustria
  2. 2.School of Economic DisciplinesUniversity of SiegenSiegenGermany

Personalised recommendations