A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Coalition formation for task allocation: theory and algorithms
2010
Autonomous Agents and Multi-Agent Systems
This paper focuses on coalition formation for task allocation in both multiagent and multi-robot domains. Two different problem formalizations are considered, one for multi-agent domains where agent resources are transferable and one for multi-robot domains. We demonstrate complexity theoretic differences between both models and show that, under both, the coalition formation problem, with m tasks, is NP-hard to both solve exactly and to approximate within a factor of O(m 1− ) for all > 0. Two
doi:10.1007/s10458-010-9123-8
fatcat:2xl7lhgzj5g55epmuia3k7lkcy