On the Complexity of Compact Coalitional Games

A significantly complete account of the complexity underlying the computation of relevant solution concepts in compact coalitional games is provided. The starting investigation point is the setting of graph games, about which various long-standing open problems were stated in the literature. The paper gives an answer to most of them, and in addition provides new insights on this setting, by stating a number of complexity results about some relevant generalizations and specializations. The presented results also pave the way towards precisely carving the tractability frontier characterizing computation problems on compact coalitional games.

[1]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[2]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[3]  Vincent Conitzer,et al.  Complexity of constructing solutions in the core based on synergies among coalitions , 2006, Artif. Intell..

[4]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[5]  J. M. Bilbao,et al.  Cooperative Games on Combinatorial Structures , 2000 .

[6]  L. S. Shapley,et al.  Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts , 1979, Math. Oper. Res..

[7]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[8]  Stig K. Andersen,et al.  Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[9]  Francesca Rossi,et al.  Semiring-based constraint solving and optimization , 1997 .

[10]  Michael Wooldridge,et al.  Computational Complexity of Weighted Threshold Games , 2007, AAAI.

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

[12]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

[13]  Rina Dechter,et al.  Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning , 1997, IJCAI.

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

[15]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[16]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[17]  Bernard De Baets,et al.  Fuzzy Sets and Systems — IFSA 2003 , 2003, Lecture Notes in Computer Science.

[19]  Martin C. Cooper.  Reduction operations in fuzzy or valued constraint satisfaction , 2003, Fuzzy Sets Syst..

[20]  Thomas Schiex,et al.  Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..

[21]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[22]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.