Coalitions among computationally bounded agents
Artificial Intelligence - Special issue on economic principles of multi-agent systems
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
Searching for Optimal Coalition Structures
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
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
On representing coalitional games with externalities
Proceedings of the 10th ACM conference on Electronic commerce
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
Coalition structure generation utilizing compact characteristic function representations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A distributed algorithm for anytime coalition structure generation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A Network Flow Approach to Coalitional Games
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Coalition structure generation with GRASP
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Constant factor approximation algorithms for coalition structure generation
Autonomous Agents and Multi-Agent Systems
Tractable model checking for fragments of higher-order coalition logic
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Concise characteristic function representations in coalitional games based on agent types
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Randomized coalition structure generation
Artificial Intelligence
On coalition formation with sparse synergies
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Coalition structure generation over graphs
Journal of Artificial Intelligence Research
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
Fostering Cooperation through Dynamic Coalition Formation and Partner Switching
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.01 |
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exhaustive and disjoint coalitions such that the social welfare is maximized. This coalition structure generation problem is extremely challenging due to the exponential number of partitions that need to be examined. Specifically, given n agents, there are O(nn) possible partitions. To date, the only algorithm that can find an optimal solution in O(3n) is the Dynamic Programming (DP) algorithm, due to Rothkopf et al. However, one of the main limitations of DP is that it requires a significant amount of memory. In this paper, we devise an Improved Dynamic Programming algorithm (IDP) that is proved to perform fewer operations than DP (e.g. 38.7% of the operations given 25 agents), and is shown to use only 33.3% of the memory in the best case, and 66.6% in the worst.