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. |
Year | DOI | Venue |
---|---|---|
2011 | 10.5555/2034396.2034448 | AAMAS |
Keywords | Field | DocType |
coalitional game,Shapley Value,Banzhaf Index,algorithmic coalitional game theory,solution concept computation,core computation,algebraic decision diagram,polynomial time,new representation,coalitional game representation scheme,Algebraic Decision Diagrams | Algebraic decision diagrams,Computer science,Shapley value,Theoretical computer science,Game theory,Artificial intelligence,Solution concept,Time complexity,Machine learning,Computation | Conference |
ISBN | Citations | PageRank |
0-9826571-7-X | 12 | 0.57 |
References | Authors | |
7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Karthik V. Aadithya | 1 | 106 | 9.06 |
Tomasz P. Michalak | 2 | 255 | 28.86 |
Nicholas R. Jennings | 3 | 19348 | 1564.35 |