Computing Stable Outcomes in Hedonic Games

We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected edge-weighted graph: nodes are players, an outcome of the game is a partition of the nodes into coalitions, and the utility of a node is the sum of incident edge weights in the same coalition. We consider several natural stability requirements defined in the economics literature. For all of them the existence of a stable outcome is guaranteed by a potential function argument, so local improvements will converge to a stable outcome and all these problems are in PLS. The different stability requirements correspond to different local search neighbourhoods. For different neighbourhood structures, our findings comprise positive results in the form of polynomial-time algorithms for finding stable outcomes, and negative (PLS-completeness) results.

[1]  Abraham P. Punnen,et al.  Approximate local search in combinatorial optimization , 2004, SODA '04.

[2]  William S. Zwicker,et al.  Coalition formation games with separable preferences , 2003, Math. Soc. Sci..

[3]  Maria-Florina Balcan,et al.  Improved equilibria via public service advertising , 2009, SODA.

[4]  Michael Wooldridge,et al.  Hedonic coalition nets , 2009, AAMAS.

[5]  Burkhard Monien,et al.  On the Power of Nodes of Degree Four in the Local Max-Cut Problem , 2010, CIAC.

[6]  Tobias Tscheuschner.  The local max-cut problem is PLS-complete even on graphs with maximum degree five , 2010, ArXiv.

[7]  Matthew O. Jackson,et al.  The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..

[8]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[9]  Coralio Ballester,et al.  NP-completeness in hedonic games , 2004, Games Econ. Behav..

[10]  Katarína Cechlárová.  Stable Partition Problem , 2008, Encyclopedia of Algorithms.

[11]  Dinko Dimitrov,et al.  Computational Complexity in Additive Hedonic Games , 2010 .

[12]  J. Drèze,et al.  HEDONIC COALITIONS: OPTIMALITY AND STABILITY , 1980 .

[13]  Sanjeev Khanna,et al.  Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games , 2010, EC '10.

[14]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[15]  Burkhard Monien,et al.  Local Search: Simple, Successful, But Sometimes Sluggish , 2010, ICALP.

[16]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[17]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[18]  Vahab S. Mirrokni,et al.  Convergence and approximation in potential games , 2006, Theor. Comput. Sci..

[19]  Vahab S. Mirrokni,et al.  Convergence and approximation in potential games , 2012, Theor. Comput. Sci..