Constrained coalition formation on valuation structures: Formal framework, applications, and islands of tractability

Coalition structure generation is the problem of partitioning the agents of a given environment into disjoint and exhaustive coalitions so that the whole available worth is maximized. While this problem has been classically studied in settings where all coalitions are allowed to form, it has been recently reconsidered in the literature moving from the observation that environments often forbid the formation of certain coalitions. By following this latter perspective, a model for coalition structure generation is proposed where constraints of two different kinds can be expressed simultaneously. Indeed, the model is based on the concept of valuation structure, which consists of a set of pivotal agents that are pairwise incompatible, plus an interaction graph prescribing that a coalition C can form only if the subgraph induced over the nodes/agents in C is connected.It is shown that valuation structures can be used to model a number of relevant problems arising in real-world application domains. Then, the complexity of coalition structure generation over valuation structures is studied, by assuming that the functions associating each coalition with its worth are given as input according to some compact encodingrather than explicitly listing all exponentially-many associations. In particular, islands of tractability are identified based on the topological properties of the underlying interaction graphs and on suitable algebraic properties of the given worth functions. Finally, stability issues over valuation structures are studied too, by considering the core as the prototypical solution concept.

[1]  Alain Billionnet,et al.  Multiway cut and integer flow problems in trees , 2004, Electron. Notes Discret. Math..

[2]  Evangelos Markakis,et al.  Characteristic function games with restricted agent interactions: Core-stability and coalition structures , 2016, Artif. Intell..

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

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

[5]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

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

[8]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

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

[10]  Éva Tardos,et al.  Algorithm design , 2005 .

[11]  Shlomo Weber,et al.  Strongly balanced cooperative games , 1992 .

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

[13]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[14]  Kyomin Jung,et al.  Coalitional Structure Generation in Skill Games , 2010, AAAI.

[15]  Sarvapali D. Ramchurn,et al.  Anytime coalition structure generation on synergy graphs , 2014, AAMAS.

[16]  Nicholas R. Jennings,et al.  Generating coalition structures with finite bound from the optimal guarantees , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[17]  Claire Cardie,et al.  Proceedings of the Eighteenth International Conference on Machine Learning, 2001, p. 577–584. Constrained K-means Clustering with Background Knowledge , 2022 .

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

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

[20]  Gabrielle Demange,et al.  The strategy structure of some coalition formation games , 2009, Games Econ. Behav..

[21]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[22]  Donald B. Gillies,et al.  3. Solutions to General Non-Zero-Sum Games , 1959 .

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

[24]  Luigi Palopoli,et al.  On the complexity of core, kernel, and bargaining set , 2008, Artif. Intell..

[25]  Haris Aziz,et al.  Complexity of coalition structure generation , 2011, AAMAS.

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

[27]  Venkatesan Guruswami,et al.  Correlation clustering with a fixed number of clusters , 2005, SODA '06.

[28]  Sarvapali D. Ramchurn,et al.  An Anytime Algorithm for Optimal Coalition Structure Generation , 2014, J. Artif. Intell. Res..

[29]  Cédric Bentz On the complexity of the multicut problem in bounded tree-width graphs and digraphs , 2008, Discret. Appl. Math..

[30]  Ian Davidson,et al.  Constrained Clustering: Advances in Algorithms, Theory, and Applications , 2008 .

[31]  Martin Szummer,et al.  A Graphical Model for Simultaneous Partitioning and Labeling , 2005, AISTATS.

[32]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[33]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

[34]  Rolf Niedermeier,et al.  Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs , 2008, Eur. J. Oper. Res..

[35]  Francesco Scarcello,et al.  Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries , 2016, SEBD.

[36]  Gabrielle Demange,et al.  On Group Stability in Hierarchies and Networks , 2004, Journal of Political Economy.

[37]  N. Jennings,et al.  Computational Coalition Formation , 2013 .

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

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

[40]  Haris Aziz,et al.  Shapley Meets Shapley , 2013, STACS.

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

[42]  Eitan Zemel,et al.  Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..

[43]  Michael Wooldridge,et al.  Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.

[44]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[45]  Makoto Yokoo,et al.  Coalition Structure Generation based on Distributed Constraint Optimization , 2010, AAAI.

[46]  Francesco Scarcello,et al.  Structural Tractability of Constraint Optimization , 2011, CP.

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

[48]  Nicholas R. Jennings,et al.  An algorithm for distributing coalitional value calculations among cooperating agents , 2007, Artif. Intell..

[49]  Avrim Blum,et al.  Correlation Clustering , 2004, Machine Learning.

[50]  Francesco Scarcello,et al.  Structural Tractability of Shapley and Banzhaf Values in Allocation Games , 2015, IJCAI.

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

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

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

[54]  Georg Gottlob,et al.  Treewidth and Hypertree Width , 2014, Tractability.

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

[56]  Nimrod Megiddo,et al.  Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..

[57]  Georg Gottlob,et al.  Decomposing combinatorial auctions and set packing problems , 2013, J. ACM.

[58]  Helena Keinänen,et al.  Simulated Annealing for Multi-agent Coalition Formation , 2009, KES-AMSTA.

[59]  Nicholas R. Jennings,et al.  A distributed algorithm for anytime coalition structure generation , 2010, AAMAS.

[60]  G. Demange Intermediate Preferences and Stable Coalition Structures , 1994 .

[61]  M. R. Rao,et al.  On the multiway cut polyhedron , 1991, Networks.

[62]  Sandip Sen,et al.  Searching for optimal coalition structures , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[63]  Piotr Faliszewski,et al.  Constrained Coalition Formation , 2011, AAAI.

[64]  Michael Wooldridge,et al.  On the computational complexity of weighted voting games , 2009, Annals of Mathematics and Artificial Intelligence.

[65]  Georg Gottlob,et al.  Hypertree Decompositions: Questions and Answers , 2016, PODS.

[66]  Nicholas R. Jennings,et al.  Coalition Structure Generation over Graphs , 2012, J. Artif. Intell. Res..

[67]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[68]  Stefan Rümmele,et al.  Multicut Algorithms via Tree Decompositions , 2010, CIAC.

[69]  Georg Gottlob,et al.  A logical approach to multicut problems , 2007, Inf. Process. Lett..