Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains

Jérôme Lang (1) , Jérôme Mengin (2) , Lirong Xia (3)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
3 SEAS - Harvard John A. Paulson School of Engineering and Applied Sciences

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.

Mots clés: maxsat problem; lexicographic preferences

Domaines: Informatique [cs]

Jérôme Lang, Jérôme Mengin, Lirong Xia. Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains. 18th International Conference on Principles and Practice of Constraint Programming (CP 2012), Oct 2012, Québec, Canada. pp.973-987, ⟨10.1007/978-3-642-33558-7_69⟩. ⟨hal-01509973⟩