Representation of coalitional games with algebraic decision diagrams

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.

[1]  E. Brigham,et al.  The fast Fourier transform and its applications , 1988 .

[2]  Michael Wooldridge,et al.  A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications , 2008, Math. Log. Q..

[3]  L. Shapley,et al.  QUASI-CORES IN A MONETARY ECONOMY WITH NONCONVEX PREFERENCES , 1966 .

[4]  Enrico Macii,et al.  Algebric Decision Diagrams and Their Applications , 1997, ICCAD '93.

[5]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[6]  Peter D. Welch,et al.  The Fast Fourier Transform and Its Applications , 1969 .

[7]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[8]  Enrico Macii,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[9]  Jörg Rothe,et al.  The Cost of Stability in Coalitional Games , 2009, SAGT.

[10]  L. Shapley.  A Value for n-person Games , 1988 .

[11]  Ingo Wegener,et al.  Optimal ordered binary decision diagrams for read-once formulas , 2000, Discret. Appl. Math..

[12]  Christoph Meinel,et al.  On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams , 1994, MFCS.

[13]  Yoav Shoham,et al.  Marginal contribution nets: a compact representation scheme for coalitional games , 2005, EC '05.

[14]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[15]  Anatol Rapoport,et al.  N-person game theory;: Concepts and applications , 1970 .

[16]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[18]  Don E. Ross,et al.  Exact ordered binary decision diagram size when representing classes of symmetric functions , 1991, J. Electron. Test..