NP-completeness in hedonic games

Games and Economic Behavior

Volumn 49, Issue 1, 2004, Pages 1-30

  Ballester, Coralio ^a  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

Coalition formation; Computational complexity; Hedonic games; NP complete; NP hard

Indexed keywords

EID: 4344563976     PISSN: 08998256     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.geb.2003.10.003     Document Type: Article

References (20)

1. Agrawal M. Kayal N. Saxena N. Primes is in P 2002 http://www.cse.iitk.ac.in/news/primality.html
2. Banerjee S. Konishi H. Sönmez T. Core in a simple coalition formation game Soc. Choice Welfare 18 1 1998 135-153
3. Ben-Porath E. The complexity of computing a best response automaton in repeated games with mixed strategies Games Econ. Behav. 2 1990 1-12
4. Bogomolnaia A. Jackson M. The stability of hedonic coalition structures Games Econ. Behav. 38 2 2002 201-230
5. Cechlárová K. Hajduková J. 2001a. Computational complexity of stable partitions with B-preferences
6. Cechlárová K. Hajduková J. Stable partitions with W-preferences Discrete Applied Math 2001 In press
7. Cook S. The P versus NP problem http://www.claymath.org/prizeproblems/ pvsnp.htm Clay Mathematics Institute
8. Diamantoudi E. Xue L. Farsighted stability in hedonic games Soc. Choice Welfare 2002 In press
9. Dreze J. Greenberg J. Hedonic coalitions: optimality and stability Econometrica 48 1980 987-1003
10. Faigle U. Kern W. Kuipers J. Computing the nucleolus in min-cost spanning tree games is NP-hard Int. J. Game Theory 27 1997 443-450
11. Faigle U. Kern W. Fekete S.P. Hochstätter W. On the complexity of testing membership in the core of min-cost spanning tree games Int. J. Game Theory 26 1997 361-366
12. Garey M.R. Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman
13. Gilboa I. The complexity of computing a best-respomse automata in repeated games J. Econ. Theory 45 1988 342-352
14. Gusfield D. Irving R.W. The Stable Marriage Problem: Structure and Algorithms 1989 MIT Press Cambridge
15. Irving R.W. An efficient algorithm for the stable roommates problem J. Algorithms 6 1985 477-595
16. Karp R.M. Reducibility among combinatorial problems In: Miller R.E. Thatcher J.W. (Eds.) Complexity of Computer Computations 1972 85-103 Plenum Press New York
17. Kaye R. Minesweeper is NP-complete Math. Intelligencer 22 2 2000 9-15
18. Konishi H. Ray D. Coalition formation as a dynamic process Boston College Working Papers in Economics 2002 478
19. Lovász L. Gács P. 1963. Complexity of Algorithms. Lecture Notes. Internet edition
20. Ronn E. 1986. On the complexity of stable matchings with and without ties. PhD thesis. Yale University