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