The algorithm design manual
Methods for task allocation via agent coalition formation
Artificial Intelligence
Computationally Manageable Combinational Auctions
Management Science
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
Near-optimal anytime coalition structure generation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Agent-based coordination technologies in disaster management
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
An improved dynamic programming algorithm for coalition structure generation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
A best-first anytime algorithm for computing optimal coalition structures
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Optimal Coalition Structure Generation In Partition Function Games
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Coalition Structures in Weighted Voting Games
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Simulated Annealing for Multi-agent Coalition Formation
KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Coalition structure generation: dynamic programming meets anytime optimization
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
Coalition structure generation utilizing compact characteristic function representations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Model and application of optimal coalition structure
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 4
Cooperative control through objective achievement
Robotics and Autonomous Systems
Multi-goal economic search using dynamic search structures
Autonomous Agents and Multi-Agent Systems
Coalition structure generation in multi-agent systems with mixed externalities
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A distributed algorithm for anytime coalition structure generation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
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
Constant factor approximation algorithms for coalition structure generation
Autonomous Agents and Multi-Agent Systems
Dynamic coalition adaptation for efficient agent-based virtual power plants
MATES'11 Proceedings of the 9th German conference on Multiagent system technologies
Computing optimal coalition structures in non-linear logistics domains
International Journal of Intelligent Information and Database Systems
From supply chain formation to multi-agent coordination
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this end, we present a novel, anytime algorithm for this task that is significantly faster than current solutions. Specifically, we empirically show that we are able to find solutions that are optimal in 0.082% of the time taken by the state of the art dynamic programming algorithm (for 27 agents), using much less memory (O(2n) instead of O(3n) for n agents). Moreover, our algorithm is the first to be able to find solutions for more than 17 agents in reasonable time (less than 90 minutes for 27 agents, as opposed to around 2 months for the best previous solution).