Show simple item record

Multiagent resource allocation in k-additive domains: preference representation and complexity

dc.contributor.authorEstivie, Sylvia
dc.contributor.authorEndriss, Ulle
dc.contributor.authorChevaleyre, Yann
dc.contributor.authorMaudet, Nicolas
HAL ID: 4473
ORCID: 0000-0002-4232-069X
dc.date.accessioned2010-01-13T14:59:43Z
dc.date.available2010-01-13T14:59:43Z
dc.date.issued2008
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2923
dc.language.isoenen
dc.subjectResource Allocationen
dc.subjectNegociationen
dc.subjectMultiagent Systemsen
dc.subjectPreference Representationen
dc.subjectComputational Complexityen
dc.subject.ddc003en
dc.titleMultiagent resource allocation in k-additive domains: preference representation and complexityen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe 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.en
dc.relation.isversionofjnlnameAnnals of Operations Research
dc.relation.isversionofjnlvol163en
dc.relation.isversionofjnlissue1en
dc.relation.isversionofjnldate2008-10
dc.relation.isversionofjnlpages49-62en
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/s10479-008-0335-0en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherSpringeren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

Thumbnail
Name:
file125605.pdf
Size:
343.7Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record