On the complexity of compact coalitional games

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 147-152

  Greco, Gianluigi ^a   Malizia, Enrico ^a   Palopoli, Luigi ^a   Scarcello, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COALITIONAL GAME; COMPLEXITY RESULTS; COMPUTATION PROBLEMS; GRAPH GAMES; SOLUTION CONCEPTS;

ARTIFICIAL INTELLIGENCE;

EID: 77957866681     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2): 308-340, 1991.
2. J. M. Bilbao. Cooperative Games on Combinatorial Structures, Kluwer Academinc Publishers, 2000.
3. V. Conitzer and T. Sandholm. Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence, 170(6-7): 607-619, 2006.
4. B. Courcelle. Graph rewriting: An algebraic and logic approach. Handbook of TCS, Vol. B, pp. 193-242, 1990.
5. X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19(2): 257-266, 1994.
6. E. Elkind, L.A. Goldberg, P.W. Goldberg, and M. Wooldridge. Computational complexity of weigthed threshold games. In Proc. of AAAI'07, pp. 718-723, 2007.
7. S. Ieong and Y. Shoham. Marginal contribution nets: a compact representation scheme for coalitional games. In Proc. of EC'05, pp. 193-202, 2005.
8. M. Maschler, B. Peleg, and L.S. Shapley. Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts. Mathematics of Operations Research, 4(4): 303-338, 1979.
9. M. W. Krentel. The complexity of optimization problems. In Proc. of STOC'86, pp. 69-76, 1986.
10. M. J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, 1994.