PP-2006-43: Chevaleyre, Yann and Endriss, Ulle and Estivie, Sylvia and Maudet, Nicolas (2006) Multiagent Resource Allocation in k-additive Domains: Preference Representation and Complexity. [Report]
Preview |
Text (Full Text)
PP-2006-43.text.pdf Download (194kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2006-43.abstract.txt Download (857B) |
Abstract
We study a framework for multiagent resource allocation where autonomous software agents negotiate over the allocation of bundles of indivisible resources. Connections to well-known combinatorial optimisation problems, including the winner determination problem in combinatorial auctions, shed light on the computational complexity of the framework. We give particular consideration to scenarios where the preferences of agents are modelled in terms of k-additive utility functions, i.e. scenarios where synergies between different resources are restricted to bundles of at most k items.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2006-43 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2006 |
| Uncontrolled Keywords: | resource allocation; negotiation; preference representation; computational complexity |
| Subjects: | Computation |
| Depositing User: | Ulle Endriss |
| Date Deposited: | 12 Oct 2016 14:36 |
| Last Modified: | 12 Oct 2016 14:36 |
| URI: | https://eprints.illc.uva.nl/id/eprint/218 |
Actions (login required)
 |
View Item |
