New complexity results on aggregating lexicographic preference trees using positional scoring rules

DOI10.1007/978-3-030-31489-7_7zbMath1431.91142OpenAlexW2979529008MaRDI QIDQ2290373

Xu-Dong Liu, Miroslaw Truszczynski

Publication date: 27 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-31489-7_7

zbMATH Keywords

computational complexitypositional scoringaggregating voteslexicographic preference trees

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Preference learning and optimization for partial lexicographic preference forests over combinatorial domains
• Handbook of social choice and welfare. Vol. 1.
• Voting on multi-issue domains with conditionally lexicographic preferences
• Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers
• Learning conditionally lexicographic preference relations
• Working with Preferences: Less Is More

This page was built for publication: New complexity results on aggregating lexicographic preference trees using positional scoring rules