Two hardness results for core stability in hedonic coalition formation games
暂无分享,去创建一个
[1] Tayfun Sönmez,et al. Core in a simple coalition formation game , 2001, Soc. Choice Welf..
[2] Gerhard J. Woeginger,et al. Core Stability in Hedonic Coalition Formation , 2012, SOFSEM.
[3] Robert W. Irving. An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.
[4] Coralio Ballester,et al. NP-completeness in hedonic games , 2004, Games Econ. Behav..
[5] Gerhard J. Woeginger,et al. A hardness result for core stability in additive hedonic games , 2013, Math. Soc. Sci..
[6] Eytan Ronn,et al. NP-Complete Stable Matching Problems , 1990, J. Algorithms.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] David Manlove,et al. Stable Marriage with Ties and Bounded Length Preference Lists , 2006, ACiD.
[9] Marek Karpinski,et al. Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..
[10] J. Drèze,et al. HEDONIC COALITIONS: OPTIMALITY AND STABILITY , 1980 .
[11] Jana Hajduková,et al. Computational complexity of stable partitions with B-preferences , 2003, Int. J. Game Theory.
[12] Matthew O. Jackson,et al. The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..
[13] Daniel S. Hirschberg,et al. Three-Dimensional Stable Matching Problems , 1991, SIAM J. Discret. Math..
[14] David Manlove,et al. The Stable Roommates Problem with Ties , 2002, J. Algorithms.
[15] Felix Brandt,et al. Optimal Partitions in Additively Separable Hedonic Games , 2011, IJCAI.
[16] Ahmet Alkan,et al. NONEXISTENCE OF STABLE THREESOME MATCHINGS , 1988 .
[17] Sang Won Bae,et al. Geometric stable roommates , 2009, Inf. Process. Lett..
[18] Jana Hajduková,et al. Stable partitions with W -preferences , 2004, Discret. Appl. Math..
[19] Ashok Subramanian,et al. A New Approach to Stable Matching Problems , 1989, SIAM J. Comput..
[20] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .