• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

Thumbnail
View/Open
FAIA215-0387.pdf (201.2Kb)
Date
2010
Dewey
Intelligence artificielle
Sujet
economic efficiency; incomplete preference information; envy-free allocation
Conference country
PORTUGAL
Book title
ECAI 2010 proceedings
Author
Wooldridge, Michael
Publisher
IOS Press
Publisher city
Tokyo
Year
2010
ISBN
978-1-60750-605-8
URI
https://basepub.dauphine.fr/handle/123456789/12137
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Bouveret, Sylvain
Endriss, Ulle
Lang, Jérôme
Type
Communication / Conférence
Item number of pages
387-392
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.