Aggregating conditionally lexicographic preferences using answer set programming solvers

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

We consider voting over combinatorial domains, where alternatives are binary tuples. We assume that votes are specified as conditionally lexicographic preference trees, or LP trees for short. We study the aggregation of LP tree votes for several positional scoring rules. Our main goal is to demonstrate that answer-set programming tools can be effective in solving the winner and the evaluation problems for instances of practical sizes. To this end, we propose encodings of the two problems as answer-set programs, design methods to generate LP tree votes randomly to support experiments, and present experimental results obtained with ASP solvers clingo and clingcon.

Original languageEnglish
Title of host publicationAlgorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings
Pages244-258
Number of pages15
DOIs
StatePublished - 2013
Event3rd International Conference on Algorithmic Decision Theory, ADT 2013 - Bruxelles, Belgium
Duration: Nov 13 2013Nov 15 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8176 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Algorithmic Decision Theory, ADT 2013
Country/TerritoryBelgium
CityBruxelles
Period11/13/1311/15/13

Keywords

  • answer set programming
  • conditionally lexicographic preferences
  • positional scoring voting rules
  • social choice theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Aggregating conditionally lexicographic preferences using answer set programming solvers'. Together they form a unique fingerprint.

Cite this