Representation of coalitional games with algebraic decision diagrams

Authors:
Karthik. V. Aadithya;Tomasz P. Michalak;Nicholas R. Jennings
Affiliations:
The University of California, Berkeley, CA;University of Southampton, UK;University of Southampton, UK
Venue:
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Year:
2011

Citing 4
Cited 3

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Algebric Decision Diagrams and Their Applications

Formal Methods in System Design
Marginal contribution nets: a compact representation scheme for coalitional games

Proceedings of the 6th ACM conference on Electronic commerce
The Cost of Stability in Coalitional Games

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory

A compact representation scheme of coalitional games based on multi-terminal zero-suppressed binary decision diagrams

PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
Efficient computation of the shapley value for game-theoretic network centrality

Journal of Artificial Intelligence Research
Coalitional games via network flows

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the advent of algorithmic coalitional game theory, it is important to design coalitional game representation schemes that are both compact and efficient with respect to solution concept computation. To this end, we propose a new representation for coalitional games, which is based on Algebraic Decision Diagrams (ADDs). Our representation is fully expressive, compact for many games of practical interest, and enables polynomial time Banzhaf Index, Shapley Value and core computation.