PP-2010-16: Bouveret, Sylvain and Endriss, Ulle and Lang, Jérôme (2010) Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods. [Report]
Preview |
Text (Full Text)
PP-2010-16.text.pdf Download (261kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2010-16.abstract.txt Download (1kB) |
Abstract
We 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.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2010-16 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2010 |
| Uncontrolled Keywords: | fair division; multiagent resource allocation; preferences; computational complexity |
| Subjects: | Computation |
| Depositing User: | Ulle Endriss |
| Date Deposited: | 12 Oct 2016 14:37 |
| Last Modified: | 12 Oct 2016 14:37 |
| URI: | https://eprints.illc.uva.nl/id/eprint/395 |
Actions (login required)
 |
View Item |
