Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
On the complexity of testing membership in the core of min-cost spanning tree games
International Journal of Game Theory
Coalition structure generation with worst case guarantees
Artificial Intelligence
Arithmetic Boolean Expression Manipulator Using BDDs
Formal Methods in System Design
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Generalized value decomposition and structured multiattribute auctions
Proceedings of the 8th ACM conference on Electronic commerce
IEEE Transactions on Computers
A tractable and expressive class of marginal contribution nets and its applications
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence
The Cost of Stability in Coalitional Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
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
On the stability of an Optimal Coalition Structure
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Representation of coalitional games with algebraic decision diagrams
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Efficient computation of the shapley value for game-theoretic network centrality
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
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. Previous studies have found that many problems in coalitional games tend to be computationally intractable in this black-box function representation. Recently, several concise representation schemes for a characteristic function have been proposed. Among them, a synergy coalition group (SCG) has several good characteristics, but its representation size tends to be large compared to other representation schemes. We propose a new concise representation scheme for a characteristic function based on a Zero-suppressed Binary Decision Diagram (ZDD) and a SCG. We show our scheme (i) is fully expressive, (ii) can be exponentially more concise than the SCG representation, (iii) can solve core-related problems in polynomial time in the number of nodes, and (iv) can solve a CSG problem reasonably well by utilizing a MIP formulation. A Binary Decision Diagram (BDD) has been used as unified infrastructure for representing/manipulating discrete structures in such various domains in AI as data mining and knowledge discovery. Adapting this common infrastructure brings up the opportunity of utilizing abundant BDD resources and cross-fertilization with these fields.