On the complexity of cooperative solution concepts
Mathematics of Operations Research
Coalition structure generation with worst case guarantees
Artificial Intelligence
Matching games: the least core and the nucleolus
Mathematics of Operations Research
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Power in threshold network flow games
Autonomous Agents and Multi-Agent Systems
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Computational complexity of weighted threshold games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Coalition structure generation utilizing compact characteristic function representations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
On agent types in coalition formation problems
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
Monotone cooperative games and their threshold versions
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Handling negative value rules in MC-net-based coalition structure generation
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Coalition structure generation over graphs
Journal of Artificial Intelligence Research
Coalitional games via network flows
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm to solve the problem for all coalitional games provided that player types are known and the number of player types is bounded by a constant. As a corollary, we obtain a polynomial-time algorithm to compute an optimal partition for weighted voting games with a constant number of weight values and for coalitional skill games with a constant number of skills. We also consider well-studied and well-motivated coalitional games defined compactly on combinatorial domains. For these games, we characterize the complexity of computing an optimal coalition structure by presenting polynomial-time algorithms, approximation algorithms, or NP-hardness and inapproximability lower bounds.