Show simple item record

dc.contributor.authorBouveret, Sylvain
dc.contributor.authorEndriss, Ulle
dc.contributor.authorLang, Jérôme
dc.date.accessioned2010-04-09T10:28:04Z
dc.date.available2010-04-09T10:28:04Z
dc.date.issued2009
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3896
dc.language.isoenen
dc.subjectCombinatorial Preferences
dc.subject.ddc006.3en
dc.titleConditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods
dc.typeCommunication / Conférence
dc.description.abstractenWhile there are several languages for representingcombinatorial preferences over sets of alternatives,none of these are well-suited to the representationof ordinal preferences over sets of goods (which aretypically required to be monotonic). We proposesuch a language, taking inspiration from previouswork on graphical languages for preference representation, specifically CP-nets, and introduce conditional importance networks (CI-nets). A CI-netincludes statements of the form “if I have a set Aof goods, and I do not have any of the goods fromsome other set B, then I prefer the set of goods Cover the set of goods D.” We investigate expressivity and complexity issues for CI-nets. Then weshow that CI-nets are well-suited to the descriptionof fair division problems.
dc.identifier.citationpages67-72
dc.relation.ispartoftitleIJCAI-09, 21st International Joint Conference on Artificial Intelligence
dc.relation.ispartofpublnameAAAI Press / IJCAI
dc.relation.ispartofpublcityPalo Alto (USA)
dc.relation.ispartofdate2009
dc.description.sponsorshipprivateouien
dc.subject.ddclabelIntelligence artificielleen
dc.relation.confcountryUNITED STATES
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2017-01-06T18:46:01Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record