Coalitional Structure Generation in Skill Games

We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the value of a coalition depends on the tasks its members can achieve. The tasks require various skills to complete them, and agents may have different skill sets. The optimal coalition structure is a partition of the agents to coalitions, that maximizes the sum of utilities obtained by the coalitions. We show that CSGs can represent any characteristic function, and consider optimal coalition structure generation in this representation. We provide hardness results, showing that in general CSGs, as well as in very restricted versions of them, computing the optimal coalition structure is hard. On the positive side, we show that the problem can be reformulated as constraint satisfaction on a hyper graph, and present an algorithm that finds the optimal coalition structure in polynomial time for instances with bounded tree-width and number of tasks.

[1]  Nicholas R. Jennings,et al.  Coalition Structures in Weighted Voting Games , 2008, ECAI.

[2]  Jeffrey S. Rosenschein,et al.  Computing the Banzhaf power index in network flow games , 2007, AAMAS '07.

[3]  Nicholas R. Jennings,et al.  An improved dynamic programming algorithm for coalition structure generation , 2008, AAMAS.

[4]  Victor R. Lesser,et al.  Coalitions Among Computationally Bounded Agents , 1997, Artif. Intell..

[5]  Jeffrey S. Rosenschein,et al.  Coalitional skill games , 2008, AAMAS.

[6]  B. Peleg,et al.  Introduction to the Theory of Cooperative Games , 1983 .

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

[8]  Nicholas R. Jennings,et al.  Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks , 2006, AAAI.

[9]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, PODS '99.

[10]  Vincent Conitzer,et al.  Coalition Structure Generation Utilizing Compact Characteristic Function Representations , 2011 .

[11]  R. J. Aumann,et al.  Cooperative games with coalition structures , 1974 .

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

[13]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[14]  Tuomas Sandholm,et al.  Anytime coalition structure generation: an average case study , 2000, J. Exp. Theor. Artif. Intell..

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[17]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[18]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[19]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[20]  Tuomas Sandholm,et al.  Anytime coalition structure generation: an average case study , 1999, AGENTS '99.

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