• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Aide
  • Connexion
  • Langue 
    • Français
    • English
Consulter le document 
  •   Accueil
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • Consulter le document
  •   Accueil
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • Consulter le document
JavaScript is disabled for your browser. Some features of this site may not work without it.

Afficher

Toute la baseCentres de recherche & CollectionsAnnée de publicationAuteurTitreTypeCette collectionAnnée de publicationAuteurTitreType

Mon compte

Connexion

Enregistrement

Statistiques

Documents les plus consultésStatistiques par paysAuteurs les plus consultés
Thumbnail - Request a copy

Voting on multi-issue domains with conditionally lexicographic preferences

Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2018), Voting on multi-issue domains with conditionally lexicographic preferences, Artificial Intelligence, 265, p. 18-44. 10.1016/j.artint.2018.05.004

Type
Article accepté pour publication ou publié
Date
2018
Nom de la revue
Artificial Intelligence
Volume
265
Éditeur
Elsevier
Pages
18-44
Identifiant publication
10.1016/j.artint.2018.05.004
Métadonnées
Afficher la notice complète
Auteur(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

Xia, Lirong
Rensslaer Polytechnic Institute, USA
Résumé (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. Such a language can usually be seen as a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences, where both the relative importance between issues and the preference between the 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 common voting rules and several classes of lexicographic preferences. We address the computation of the winning alternative for some important rules, both by identifying the computational complexity of the relevant problems and by showing that for several of them, computing the winner reduces in a very natural way to a maxsat problem.
Mots-clés
Computational social choice; Voting; Winner determination; Lexicographic preferences; Maximum satisfiability

Publications associées

Affichage des éléments liés par titre et auteur.

  • Vignette de prévisualisation
    Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains 
    Lang, Jérôme; Mengin, Jérôme; Xia, Lirong (2012) Communication / Conférence
  • Vignette de prévisualisation
    Sequential composition of voting rules in multi-issue domains 
    Lang, Jérôme; Xia, Lirong (2009) Article accepté pour publication ou publié
  • Vignette de prévisualisation
    Strategic Sequential Voting in Multi-Issue Domains and Multiple-Election Paradoxes 
    Xia, Lirong; Conitzer, Vincent; Lang, Jérôme (2011) Communication / Conférence
  • Vignette de prévisualisation
    Hypercubewise Preference Aggregation in Multi-Issue Domains 
    Conitzer, Vincent; Lang, Jérôme; Xia, Lirong (2011) Communication / Conférence
  • Vignette de prévisualisation
    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
Tél. : 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo