Show simple item record

dc.contributor.authorAziz, Haris
dc.contributor.authorLang, Jérôme
dc.contributor.authorMonnot, Jérôme
dc.date.accessioned2016-09-23T16:45:46Z
dc.date.available2016-09-23T16:45:46Z
dc.date.issued2016
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/15829
dc.language.isoenen
dc.subjectComputational Social Choiceen
dc.subjectvotingen
dc.subjectNP-hardnessen
dc.subject.ddc003en
dc.titleComputing Pareto Optimal Committeesen
dc.typeCommunication / Conférence
dc.description.abstractenSelecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for desirability of a committee, Pareto optimality is a minimal and important requirement.As asking agents to specify their preferences over exponentially many subsets of alternatives is practically infeasible,we assume that each agent specifies a weak order on single alternatives, from which a preference relation over subsets is derived using some preference extension.We consider four prominent extensions (responsive, leximax, best, and worst). For each of them, we consider the corresponding Pareto optimality notion, and we study the complexity of computing and verifying Pareto optimal outcomes. We also consider strategic issues: for three of the set extensions, we present linear-time, Pareto optimal and strategyproof algorithms that work even for weak preferences.en
dc.identifier.citationpages60-66en
dc.relation.ispartoftitleProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 Julyen
dc.relation.ispartofeditorKambhampati, Subbarao
dc.relation.ispartofpublnameAAAI Press / IJCAIen
dc.relation.ispartofdate2016
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-1-57735-770-4en
dc.relation.conftitleTwenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016en
dc.relation.confdate2016-07
dc.relation.confcityNew Yorken
dc.relation.confcountryUnited Statesen
dc.relation.forthcomingnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewednonen
dc.relation.Isversionofjnlpeerreviewednonen
dc.date.updated2016-09-23T14:20:44Z
hal.person.labIds209491
hal.person.labIds989
hal.person.labIds989
hal.identifierhal-01371075*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record