Show simple item record

dc.contributor.authorBouveret, Sylvain
HAL ID: 976
ORCID: 0000-0002-1570-5244
dc.contributor.authorEndriss, Ulle
dc.contributor.authorLang, Jérôme
dc.date.accessioned2013-11-22T12:25:48Z
dc.date.available2013-11-22T12:25:48Z
dc.date.issued2010
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/12137
dc.language.isoenen
dc.subjecteconomic efficiency
dc.subjectincomplete preference information
dc.subjectenvy-free allocation
dc.subject.ddc006.3en
dc.titleFair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
dc.typeCommunication / Conférence
dc.description.abstractenWe study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (rather than utility functions) and when our knowledge of those preferences is incomplete. The incompleteness of the preferences stems from the fact that each agent reports their preferences by means of an expression of bounded size in a compact preference representation language. Specifically, we assume that each agent only provides a ranking of individual goods (rather than of bundles). In this context, we consider the algorithmic problem of deciding whether there exists an allocation that is possibly (or necessarily) envy-free, given the incomplete preference information available, if in addition some mild economic efficiency criteria need to be satisfied. We provide simple characterisations, giving rise to simple algorithms, for some instances of the problem, and computational complexity results, establishing the intractability of the problem, for others.
dc.identifier.citationpages387-392
dc.relation.ispartoftitleECAI 2010 proceedings
dc.relation.ispartofeditorWooldridge, Michael
dc.relation.ispartofpublnameIOS Press
dc.relation.ispartofpublcityTokyo
dc.relation.ispartofdate2010
dc.subject.ddclabelIntelligence artificielleen
dc.relation.ispartofisbn978-1-60750-605-8
dc.relation.confcountryPORTUGAL
dc.relation.forthcomingnonen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2017-01-06T18:07:52Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record