Aggregating conditionally lexicographic preferences using answer set programming solvers

Xudong Liu; Miroslaw Truszczynski

doi:10.1007/978-3-642-41575-3_19

Aggregating conditionally lexicographic preferences using answer set programming solvers

Xudong Liu, Miroslaw Truszczynski

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings
Pages	244-258
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-41575-3_19
State	Published - 2013
Event	3rd International Conference on Algorithmic Decision Theory, ADT 2013 - Bruxelles, Belgium Duration: Nov 13 2013 → Nov 15 2013

Publication series

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

Conference

Conference	3rd International Conference on Algorithmic Decision Theory, ADT 2013
Country/Territory	Belgium
City	Bruxelles
Period	11/13/13 → 11/15/13

Keywords

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

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-41575-3_19

Cite this

Liu, X., & Truszczynski, M. (2013). Aggregating conditionally lexicographic preferences using answer set programming solvers. In Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings (pp. 244-258). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8176 LNAI). https://doi.org/10.1007/978-3-642-41575-3_19

@inproceedings{99dfb2b72af24296bda0da363fcd04c1,

title = "Aggregating conditionally lexicographic preferences using answer set programming solvers",

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.",

keywords = "answer set programming, conditionally lexicographic preferences, positional scoring voting rules, social choice theory",

author = "Xudong Liu and Miroslaw Truszczynski",

year = "2013",

doi = "10.1007/978-3-642-41575-3_19",

language = "English",

isbn = "9783642415746",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "244--258",

booktitle = "Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings",

note = "3rd International Conference on Algorithmic Decision Theory, ADT 2013 ; Conference date: 13-11-2013 Through 15-11-2013",

}

Liu, X & Truszczynski, M 2013, Aggregating conditionally lexicographic preferences using answer set programming solvers. in Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8176 LNAI, pp. 244-258, 3rd International Conference on Algorithmic Decision Theory, ADT 2013, Bruxelles, Belgium, 11/13/13. https://doi.org/10.1007/978-3-642-41575-3_19

Aggregating conditionally lexicographic preferences using answer set programming solvers. / Liu, Xudong; Truszczynski, Miroslaw.
Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. 2013. p. 244-258 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8176 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Aggregating conditionally lexicographic preferences using answer set programming solvers

AU - Liu, Xudong

AU - Truszczynski, Miroslaw

PY - 2013

Y1 - 2013

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

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

KW - answer set programming

KW - conditionally lexicographic preferences

KW - positional scoring voting rules

KW - social choice theory

UR - http://www.scopus.com/inward/record.url?scp=84890084957&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890084957&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-41575-3_19

DO - 10.1007/978-3-642-41575-3_19

M3 - Conference contribution

AN - SCOPUS:84890084957

SN - 9783642415746

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 244

EP - 258

BT - Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings

T2 - 3rd International Conference on Algorithmic Decision Theory, ADT 2013

Y2 - 13 November 2013 through 15 November 2013

ER -

Liu X, Truszczynski M. Aggregating conditionally lexicographic preferences using answer set programming solvers. In Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. 2013. p. 244-258. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-41575-3_19

Aggregating conditionally lexicographic preferences using answer set programming solvers

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this