Solving Coalition Structure Generation Problems over Weighted Graph

Coalition Structure Generation (CSG), which is a leading research issue in the domain of coalitional games, divides agents into exhaustive and disjoint coalitions to optimize social welfare. This paper studies CSG problems over weighted undirected graphs in which the weight on an edge between any two connecting agents represents how well they work together in a coalition. The weight can have either a positive or a negative value. We examine two types of problems. One is a CSG without any restrictions on the number of coalitions, and another is a CSG with k coalitions where k is determined in advance. We present two methods to solve these problems: ILP formulation and MaxSAT encoding.

[1]  Makoto Yokoo,et al.  Improved WPM encoding for coalition structure generation under MC-nets , 2018, Constraints.

[2]  Christos Faloutsos,et al.  Edge Weight Prediction in Weighted Signed Networks , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[3]  Morteza Zadimoghaddam,et al.  Optimal Coalition Structure Generation in Cooperative Graph Games , 2013, AAAI.

[4]  Roger B. Myerson,et al.  Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[5]  Makoto Yokoo,et al.  A Compact Representation Scheme of Coalitional Games Based on Multi-Terminal Zero-Suppressed Binary Decision Diagrams , 2011, PRIMA.

[6]  Makoto Yokoo,et al.  Concise Characteristic Function Representations in Coalitional Games Based on Agent Types , 2011, IJCAI.

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

[8]  Jure Leskovec,et al.  Exploiting Social Network Structure for Person-to-Person Sentiment Analysis , 2014, TACL.

[9]  Felip Manyà,et al.  MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

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

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

[12]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[13]  Fahiem Bacchus,et al.  Exploiting the Power of mip Solvers in maxsat , 2013, SAT.

[14]  Matti Järvisalo,et al.  Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability , 2017, Artif. Intell..

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

[16]  Miyuki Koshimura,et al.  Solving the Coalition Structure Generation Problem with MaxSAT , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[17]  Sarit Kraus,et al.  Forming k coalitions and facilitating relationships in social networks , 2018, Artif. Intell..

[18]  Joao Marques-Silva,et al.  PySAT: A Python Toolkit for Prototyping with SAT Oracles , 2018, SAT.

[19]  Tomohiro Sonobe,et al.  Exact Clustering via Integer Programming and Maximum Satisfiability , 2018, AAAI.

[20]  Rafael Amer,et al.  A connectivity game for graphs , 2004, Math. Methods Oper. Res..

[21]  Nicholas R. Jennings,et al.  Coalition structure generation: A survey , 2015, Artif. Intell..

[22]  Yoshiko Wakabayashi,et al.  A cutting plane algorithm for a clustering problem , 1989, Math. Program..

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

[24]  Sarvapali D. Ramchurn,et al.  On coalition formation with sparse synergies , 2012, AAMAS.

[25]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[26]  Makoto Yokoo,et al.  Handling negative value rules in MC-net-based coalition structure generation , 2012, AAMAS.