Multiagent resource allocation in k-additive domains: preference representation and complexity
Estivie, Sylvia; Endriss, Ulle; Chevaleyre, Yann; Maudet, Nicolas (2008), Multiagent resource allocation in k-additive domains: preference representation and complexity, Annals of Operations Research, 163, 1, p. 49-62. http://dx.doi.org/10.1007/s10479-008-0335-0
TypeArticle accepté pour publication ou publié
Journal nameAnnals of Operations Research
MetadataShow full item record
Abstract (EN)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.
Subjects / KeywordsResource Allocation; Negociation; Multiagent Systems; Preference Representation; Computational Complexity
Showing items related by title and author.
Chevaleyre, Yann; Dunne, Paul; Endriss, Ulle; Lang, Jérôme; Lemaître, Michel; Maudet, Nicolas; Padget, Julian; Phelps, Steve; Rodríguez-Aguilar, Juan A.; Sousa, Paulo (2006) Article accepté pour publication ou publié