Coalition structure generation with worst case guarantees
Artificial Intelligence
An algorithm for distributing coalitional value calculations among cooperating agents
Artificial Intelligence
An improved dynamic programming algorithm for coalition structure generation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Coalition structure generation: dynamic programming meets anytime optimization
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Methods for task allocation via agent coalition formation
Artificial Intelligence
A distributed algorithm for anytime coalition structure generation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
C-link: a hierarchical clustering approach to large-scale near-optimal coalition formation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fostering Cooperation through Dynamic Coalition Formation and Partner Switching
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.00 |
We consider coalition formation problems for agents with an underlying synergistic graph, where edges between agents represent some vital synergistic link, such as communication, trust, or physical constraints. A coalition is infeasible if its members do not form a connected subgraph, meaning parts of the coalition are isolated from others. Current state-of-the-art coalition formation algorithms are not designed for problems over synergistic graphs. They assume that all coalitions are feasible and so involve redundant computation when this is not the case. Accordingly, we propose algorithms, namely D-SlyCE and DyCE, to enumerate all feasible coalitions in a distributed fashion and find the optimal feasible coalition structure respectively. When evaluated on a variety of synergistic graphs, D-SlyCE is up to 660 times faster while DyCE is up to 7 x 104 times faster than the state-of-the-art algorithms. For particular classes of graphs, D-SlyCE is the first to enumerate valid coalition values for up to 50 agents and DyCE is the first algorithm to find the optimal coalition structure for up to 30 agents in minutes as opposed to months for previous algorithms.