Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the complexity of cooperative solution concepts
Mathematics of Operations Research
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Coalitions among computationally bounded agents
Artificial Intelligence - Special issue on economic principles of multi-agent systems
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Computationally Manageable Combinational Auctions
Management Science
Coalition structure generation with worst case guarantees
Artificial Intelligence
Customer coalitions in the electronic marketplace
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
Machine Learning
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
Distributed constraint optimization for multiagent systems
Distributed constraint optimization for multiagent systems
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
An algorithm for distributing coalitional value calculations among cooperating agents
Artificial Intelligence
IEEE Transactions on Knowledge and Data Engineering
An improved dynamic programming algorithm for coalition structure generation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
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
Overlapping coalition formation for efficient data fusion in multi-sensor networks
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A compact representation scheme for coalitional games in open anonymous environments
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Methods for task allocation via agent coalition formation
Artificial Intelligence
Complexity of constructing solutions in the core based on synergies among coalitions
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
Coalition structure generation with GRASP
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Complexity of coalition structure generation
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
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
Hi-index | 0.00 |
We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into connected subsets, that maximises the sum of the components' values. This problem is generally NP-complete; in particular, it is hard for a defined class of valuation functions which are independent of disconnected members-that is, two nodes have no effect on each other's marginal contribution to their vertex separator. Nonetheless, for all such functions we provide bounds on the complexity of coalition structure generation over general and minor-free graphs. Our proof is constructive and yields algorithms for solving corresponding instances of the problem. Furthermore, we derive linear time bounds for graphs of bounded treewidth. However, as we show, the problem remains NP-complete for planar graphs, and hence, for any Kk minor-free graphs where k ≥ 5. Moreover, a 3-SAT problem with m clauses can be represented by a coalition structure generation problem over a planar graph with O(m2) nodes. Importantly, our hardness result holds for a particular subclass of valuation functions, termed edge sum, where the value of each subset of nodes is simply determined by the sum of given weights of the edges in the induced subgraph.