• français
    • English
  • français 
    • français
    • English
  • Connexion
JavaScript is disabled for your browser. Some features of this site may not work without it.
Accueil

Afficher

Cette collectionPar Date de CréationAuteursTitresSujetsNoms de revueToute la baseCentres de recherche & CollectionsPar Date de CréationAuteursTitresSujetsNoms de revue

Mon compte

Connexion

Statistiques

Afficher les statistiques d'usage

Voting on multi-issue domains with conditionally lexicographic preferences

Thumbnail
Date
2018
Indexation documentaire
Intelligence artificielle
Subject
Computational social choice; Voting; Winner determination; Lexicographic preferences; Maximum satisfiability
Nom de la revue
Artificial Intelligence
Volume
265
Date de publication
12-2018
Pages article
18-44
Nom de l'éditeur
Elsevier
DOI
http://dx.doi.org/10.1016/j.artint.2018.05.004
URI
https://basepub.dauphine.fr/handle/123456789/19152
Collections
  • LAMSADE : Publications
Métadonnées
Afficher la notice complète
Auteur
Lang, Jérôme
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Mengin, Jérôme
status unknown
Xia, Lirong
561317 Rensslaer Polytechnic Institute, USA
Type
Article accepté pour publication ou publié
Résumé en anglais
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Cette création est mise à disposition sous un contrat Creative Commons.