Computing stable outcomes in hedonic games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6386 LNCS, Issue M4D, 2010, Pages 174-185

  Gairing, Martin ^a   Savani, Rahul ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COALITION FORMATIONS; EDGE WEIGHTS; EDGE-WEIGHTED GRAPH; LOCAL SEARCH; NATURAL STABILITY; NEIGHBOURHOOD; POLYNOMIAL-TIME ALGORITHMS; POTENTIAL FUNCTION; STABILITY REQUIREMENTS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

GAME THEORY;

EID: 78649626080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16170-4_16     Document Type: Conference Paper

References (19)

1. Aarts, E. H. L., Lenstra, J. K.: Local Search in Combinatorial Optimization. Wiley Interscience, Hoboken (1997)
2. Balcan, M.-F., Blum, A., Mansour, Y.: Improved equilibria via public service advertising. In: SODA, pp. 728-737 (2009)
3. Ballester, C.: NP-completeness in hedonic games. Games and Economic Behavior 49(1), 1-30 (2004)
4. Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating pure Nash equilibrium in cut, party affiliation and satisfiability games. In: ACM Conference in Electronic Commerce (EC), pp. 132-146 (2010)
5. Bogomolnaia, A., Jackson, M. O.: The stability of hedonic coalition structures. Games and Economic Behavior 38(2), 201-230 (2002)
6. Burani, N., Zwicker, W. S.: Coalition formation games with separable preferences. Mathematical Social Sciences 45(1), 27-52 (2003)
7. Cechlárová, K.: Stable partition problem. In: Encyclopedia of Algorithms. Springer, Heidelberg (2008)
8. Christodoulou, G., Mirrokni, V. S., Sidiropoulos, A.: Convergence and approximation in potential games. In: STACS, pp. 349-360 (2006)
9. Dreze, J. H., Greenberg, J.: Hedonic coalitions: Optimality and stability. Econometrica 48(4), 987-1003 (1980)
10. Elkind, E., Wooldridge, M.: Hedonic coalition nets. In: Int. Conference on Autonomous Agents and Multiagent Systems, pp. 417-424 (2009)
11. Greenberg, J.: Coalition structures. In: Aumann, R. J., Hart, S. (eds.) Handbook of Game Theory with Economic Applications II. Elsevier, Amsterdam (1994)
12. Johnson, D. S., Papadimitriou, C. H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences 37, 79-100 (1988)
13. Monien, B., Tscheuschner, T.: On the power of nodes of degree four in the local max-cut problem. In: 7th International Conference on Algorithms and Complexity, CIAC (2010)
14. Monien, B., Dumrauf, D., Tscheuschner, T.: Local search: Simple, successful, but sometimes sluggish. In: 37th International Colloquium on Automata, Languages and Programming, ICALP (2010)
15. Orlin, J. B., Punnen, A. P., Schulz, A. S.: Approximate local search in combinatorial optimization. SIAM Journal of Computing 33(5), 1201-1214 (2004)
16. Schäffer, A. A., Yannakakis, M.: Simple Local Search Problems that are Hard to Solve. SIAM Journal of Computing 20(1), 56-87 (1991)
17. Sipser, M.: Introduction to the Theory of Computation. Thomson (2006)
18. Sung, S. C., Dimitrov, D.: Computational complexity in additive hedonic games. European Journal of Operational Research 203(3), 635-639 (2010)
19. Tscheuschner, T.: The local max-cut problem is PLS-complete even on graphs with maximum degree five (2010), http://arxiv.org/abs/1004.5329