Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Voting on multi-issue domains with conditionally lexicographic preferences |
scientific article |
Statements
Voting on multi-issue domains with conditionally lexicographic preferences (English)
0 references
2 August 2019
0 references
This paper studies the aggregation of conditionally lexicographic preferences. Different common voting rules and several classes of lexicographic preferences are examined. The computation of the winning alternative for the rules is addressed both by identifying the computational complexity of the relevant problems and by showing that, for several of them, computing the winner can be reduced to a maxsat problem. Multiwinner voting rules are also considered.
0 references
computational social choice
0 references
voting
0 references
winner determination
0 references
lexicographic preferences
0 references
maximum satisfiability
0 references
0 references
0 references
