Coalition structure generation with worst case guarantees
Artificial Intelligence
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Searching for Optimal Coalition Structures
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Combinatorial Auctions
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 in Task-Based Settings
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
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
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
Coalition structure generation in multi-agent systems with positive and negative externalities
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Bayesian Heuristic Approach to Discrete and Global Optimization: Algorithms, Visualization, Software, and Applications
Coalition structure generation over graphs
Journal of Artificial Intelligence Research
An efficient vector-based representation for coalitional games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
The coalition structure generation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involved in a system into disjoint coalitions. The problem of finding the optimal coalition structure is NP-complete. In order to find the optimal solution in a combinatorial optimization problem it is theoretically possible to enumerate the solutions and evaluate each. But this approach is infeasible since the number of solutions often grows exponentially with the size of the problem. In this paper we present a greedy adaptive search procedure (GRASP) to efficiently search the space of coalition structures in order to find an optimal one.