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

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...

Ausführliche Beschreibung