Coalition structure generation with worst case guarantees
Artificial Intelligence
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
Anytime optimal coalition structure generation
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Near-optimal anytime coalition structure generation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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
An algorithm for computing optimal coalition structures in non-linear logistics domains
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Computing optimal coalition structures in non-linear logistics domains
International Journal of Intelligent Information and Database Systems
Optimal service composition via agent-based quality of service
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Towards optimal service composition upon QoS in agent cooperation
International Journal of Computational Science and Engineering
Hi-index | 0.00 |
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition values, while existing algorithms base their generation on the structure (members and configurations) of coalitions. With our algorithm, coalition structures are generated by repeatedly choosing the best coalition, as determined using a novel metric called agent's contribution to coalition structure that we define. We have compared the performance of our algorithm against that of Rahwan et al [5] using 20 data distributions. Our results show that our algorithm almost always converges on an optimal coalition structure faster (although it terminates later in some cases). Empirically, our algorithm almost always yields better than or as good as Rahwan et al's results at any point in time.