Zoekopdracht:
faculteit: "FNWI" en publicatiejaar: "2010"
| Auteurs | S. Bouveret, U. Endriss, J. Lang | | Titel | Fair division under ordinal preferences: computing envy-free allocations of indivisible goods |
| Boek/bron titel | Proceedings of the 19th European Conference on Artificial Intelligence (ECAI-2010) |
| Auteurs/Editors | H. Coelho, R. Studer, M. Woolridge |
| Uitgever | IOS Press |
| Plaats | Amsterdam |
| Jaar | 2010 |
| Pagina's | 387-392 |
| ISBN | 9781607506058 |
| Faculteit | Faculteit der Natuurwetenschappen, Wiskunde en Informatica |
| Instituut/afd. | FNWI: Institute for Logic, Language and Computation (ILLC) |
| Samenvatting | 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. |
| Soort document | Hoofdstuk |
| Download bestand | |
| Document finder | 
|
Gebruik dit adres om naar deze pagina te linken: http://dare.uva.nl/record/370249
Vraag/opmerking over dit recordMail aan een collega
Toevoegen aan bewaarset
|
vorige
