Show simple item record

Voting on multi-issue domains with conditionally lexicographic preferences

hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorLang, Jérôme
hal.structure.identifier
dc.contributor.authorMengin, Jérôme
HAL ID: 184956
hal.structure.identifierRensslaer Polytechnic Institute, USA
dc.contributor.authorXia, Lirong
dc.date.accessioned2019-07-04T08:09:46Z
dc.date.available2019-07-04T08:09:46Z
dc.date.issued2018
dc.identifier.issn0004-3702
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/19152
dc.language.isoenen
dc.subjectComputational social choiceen
dc.subjectVotingen
dc.subjectWinner determinationen
dc.subjectLexicographic preferencesen
dc.subjectMaximum satisfiabilityen
dc.subject.ddc006.3en
dc.titleVoting on multi-issue domains with conditionally lexicographic preferencesen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenOne 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.en
dc.relation.isversionofjnlnameArtificial Intelligence
dc.relation.isversionofjnlvol265en
dc.relation.isversionofjnldate2018-12
dc.relation.isversionofjnlpages18-44en
dc.relation.isversionofdoi10.1016/j.artint.2018.05.004en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelIntelligence artificielleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2019-03-28T11:31:34Z
hal.faultCode{"duplicate-entry":{"hal-02147965":{"doi":"1.0"}}}
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record