On the complexity of cooperative solution concepts
Mathematics of Operations Research
Coalition structure generation with worst case guarantees
Artificial Intelligence
Some Tractable Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Divide and conquer: false-name manipulations in weighted voting games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Power and stability in connectivity games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
An improved dynamic programming algorithm for coalition structure generation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Computing the nucleolus of weighted voting games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Power Indices in Spanning Connectivity Games
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
On the computational complexity of coalitional resource games
Artificial Intelligence
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence
Simple coalitional games with beliefs
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
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 |
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been attracting considerable attention from the AI research community. Traditionally, the input of a coalitional game is a black-box function called a characteristic function. A range of previous studies have found that many problems in coalitional games tend to be computationally intractable when the input is a black-box function. Recently, several concise representation schemes for a characteristic function have been proposed. Although these schemes are effective for reducing the representation size, most problems remain computationally intractable. In this paper, we develop a new concise representation scheme based on the idea of agent types. Intuitively, a type represents a set of agents, which are recognized as having the same contribution. This representation can be exponentially more concise than existing concise representation schemes. Furthermore, this idea can be used in conjunction with existing schemes to further reduce the representation size. Moreover, we show that most of the problems in coalitional games, including CSG, can be solved in polynomial time in the number of agents, assuming the number of possible types is fixed.