Anytime coalition structure generation with worst case guarantees
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Coalition structure generation with worst case guarantees
Artificial Intelligence
Satisficing coalition formation among agents
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Task allocation via coalition formation among autonomous agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Coalition formation among bounded rational agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A pruning-based algorithm for computing optimal coalition structures in linear production domains
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Towards optimal service composition upon QoS in agent cooperation
International Journal of Computational Science and Engineering
Hi-index | 0.00 |
Coalition formation is an important area of research in multi-agent systems. Computing optimal coalition structures for a large number of agents is an important problem in coalition formation but has received little attention in the literature. Previous studies assume that each coalition value is known a priori. This assumption is impractical in real world settings. Furthermore, the problem of finding coalition values become intractable for even a relatively small number of agents. This work proposes a distributed branch-and-bound algorithm for computing optimal coalition structures in linear production domain, where each coalition value is not known a priori. The common goal of the agents is to maximize the system's profit. In our algorithm, agents perform two tasks: i) deliberate profitable coalitions, and ii) cooperatively compute optimal coalition structures. We show that our algorithm outperforms exhaustive search in generating optimal coalition structure in terms of elapses time and number of coalition structures generated.