
Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains
Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2012), Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains, in Milano, Michela, Principles and Practice of Constraint Programming - CP 2012 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012, Proceedings, Springer : Berlin Heidelberg, p. 973-987
View/ Open
Type
Communication / ConférenceDate
2012Conference title
18th International Conference on Principles and Practice of Constraint Programming - CP 2012Conference date
2012-10Conference city
Québec CityConference country
CanadaBook title
Principles and Practice of Constraint Programming - CP 2012 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012, ProceedingsBook author
Milano, MichelaPublisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-642-33557-0
Pages
973-987
Metadata
Show full item recordAuthor(s)
Lang, JérômeLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Mengin, Jérôme
Institut de recherche en informatique de Toulouse [IRIT]
Xia, Lirong
School of engineering and Apllied Sciences, Harvard University
Abstract (EN)
One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters’ preferences are elicited and aggregated. A language usually comes with a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences, where both the relative importance between issues and the preference between values of an issue may depend on the values taken by more important issues. The naturally associated language consists in describing conditional importance and conditional preference by trees together with conditional preference tables. In this paper, we study the aggregation of conditionally lexicographic preferences, for several voting rules and several restrictions of the framework. We characterize computational complexity for some popular cases, and show that in many of them, computing the winner reduces in a very natural way to a maxsat problem.Subjects / Keywords
maxsat problem; lexicographic preferencesRelated items
Showing items related by title and author.
-
Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2018) Article accepté pour publication ou publié
-
Conitzer, Vincent; Lang, Jérôme; Xia, Lirong (2011) Communication / Conférence
-
Lang, Jérôme; Xia, Lirong (2009) Article accepté pour publication ou publié
-
Xia, Lirong; Conitzer, Vincent; Lang, Jérôme (2011) Communication / Conférence
-
Booth, Richard; Chevaleyre, Yann; Lang, Jérôme; Mengin, Jérôme; Sombattheera, Chattrakul (2010) Communication / Conférence