• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

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
paper_26.pdf (344.2Kb)
Type
Communication / Conférence
Date
2012
Conference title
18th International Conference on Principles and Practice of Constraint Programming - CP 2012
Conference date
2012-10
Conference city
Québec City
Conference country
Canada
Book title
Principles and Practice of Constraint Programming - CP 2012 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012, Proceedings
Book author
Milano, Michela
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-642-33557-0
Pages
973-987
Metadata
Show full item record
Author(s)
Lang, Jérôme
Laboratoire 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 preferences

Related items

Showing items related by title and author.

  • Thumbnail
    Voting on multi-issue domains with conditionally lexicographic preferences 
    Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2018) Article accepté pour publication ou publié
  • Thumbnail
    Hypercubewise Preference Aggregation in Multi-Issue Domains 
    Conitzer, Vincent; Lang, Jérôme; Xia, Lirong (2011) Communication / Conférence
  • Thumbnail
    Sequential composition of voting rules in multi-issue domains 
    Lang, Jérôme; Xia, Lirong (2009) Article accepté pour publication ou publié
  • Thumbnail
    Strategic Sequential Voting in Multi-Issue Domains and Multiple-Election Paradoxes 
    Xia, Lirong; Conitzer, Vincent; Lang, Jérôme (2011) Communication / Conférence
  • Thumbnail
    Learning conditionally lexicographic preference relations 
    Booth, Richard; Chevaleyre, Yann; Lang, Jérôme; Mengin, Jérôme; Sombattheera, Chattrakul (2010) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo