Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Simple local search problems that are hard to solve
SIAM Journal on Computing
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Approximate Local Search in Combinatorial Optimization
SIAM Journal on Computing
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the power of nodes of degree four in the local max-cut problem
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Settling the complexity of local max-cut (almost) completely
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Stable partitions in additively separable hedonic games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing stable outcomes in hedonic games with voting-based deviations
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Dynamics of profit-sharing games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
Information Processing Letters
Computing desirable partitions in additively separable hedonic games
Artificial Intelligence
Stable marriage and roommate problems with individual-based stability
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
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.