{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T10:59:30Z","timestamp":1772017170037,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642358425","type":"print"},{"value":"9783642358432","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35843-2_4","type":"book-chapter","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T02:24:54Z","timestamp":1357871094000},"page":"33-50","source":"Crossref","is-referenced-by-count":23,"title":["Core Stability in Hedonic Coalition Formation"],"prefix":"10.1007","author":[{"given":"Gerhard J.","family":"Woeginger","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0165-4896(88)90053-4","volume":"16","author":"A. Alkan","year":"1988","unstructured":"Alkan, A.: Non-existence of stable threesome matchings. Mathematical Social Sciences\u00a016, 207\u2013209 (1988)","journal-title":"Mathematical Social Sciences"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.ipl.2008.10.003","volume":"109","author":"E.M. Arkin","year":"2009","unstructured":"Arkin, E.M., Bae, S.W., Efrat, A., Okamoto, K., Mitchell, J.S.B., Polishchuk, V.: Geometric stable roommates. Information Processing Letters\u00a0109, 219\u2013224 (2009)","journal-title":"Information Processing Letters"},{"key":"4_CR3","unstructured":"Aziz, H., Brandt, F., Seedig, H.G.: Stable partitions in additively separable hedonic games. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 183\u2013190 (2001)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.geb.2003.10.003","volume":"49","author":"C. Ballester","year":"2004","unstructured":"Ballester, C.: NP-completeness in hedonic games. Games and Economic Behavior\u00a049, 1\u201330 (2004)","journal-title":"Games and Economic Behavior"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s003550000067","volume":"18","author":"S. Banerjee","year":"2001","unstructured":"Banerjee, S., Konishi, H., S\u00f6nmez, T.: Core in a simple coalition formation game. Social Choice and Welfare\u00a018, 135\u2013153 (2001)","journal-title":"Social Choice and Welfare"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Barber\u00e0, S., Bossert, W., Pattanaik, P.K.: Ranking sets of objects. In: Barber\u00e0, S., Hammond, P.J., Seidl, C. (eds.) Handbook of Utility Theory, vol.\u00a0II, pp. 893\u2013977. Kluwer Academic Publishers (2004)","DOI":"10.1007\/978-1-4020-7964-1_4"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00453-009-9315-2","volume":"58","author":"P. Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., McDermid, E.: Three-sided stable matchings with cyclic preferences. Algorithmica\u00a058, 5\u201318 (2010)","journal-title":"Algorithmica"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/game.2001.0877","volume":"38","author":"A. Bogomolnaia","year":"2002","unstructured":"Bogomolnaia, A., Jackson, M.O.: The stability of hedonic coalition structures. Games and Economic Behavior\u00a038, 201\u2013230 (2002)","journal-title":"Games and Economic Behavior"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2004.08.012","volume":"289","author":"E. Boros","year":"2004","unstructured":"Boros, E., Gurvich, V., Jaslar, S., Krasner, D.: Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematics\u00a0289, 1\u201310 (2004)","journal-title":"Discrete Mathematics"},{"key":"4_CR10","volume-title":"Asymptotic Methods in Analysis","author":"N.G. Bruijn de","year":"1958","unstructured":"de Bruijn, N.G.: Asymptotic Methods in Analysis. North-Holland, Amsterdam (1958)"},{"key":"4_CR11","first-page":"353","volume":"31","author":"K. Cechl\u00e1rov\u00e1","year":"2002","unstructured":"Cechl\u00e1rov\u00e1, K., Hajdukov\u00e1, J.: Computational complexity of stable partitions with B-preferences. International Journal of Game Theory\u00a031, 353\u2013364 (2002)","journal-title":"International Journal of Game Theory"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0166-218X(03)00464-5","volume":"138","author":"K. Cechl\u00e1rov\u00e1","year":"2004","unstructured":"Cechl\u00e1rov\u00e1, K., Hajdukov\u00e1, J.: Stable partitions with W-preferences. Discrete Applied Mathematics\u00a0138, 333\u2013347 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s001820000053","volume":"29","author":"K. Cechl\u00e1rov\u00e1","year":"2001","unstructured":"Cechl\u00e1rov\u00e1, K., Romero-Medina, A.: Stability in coalition formation games. International Journal of Game Theory\u00a029, 487\u2013494 (2001)","journal-title":"International Journal of Game Theory"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-15369-3_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P. Chebolu","year":"2010","unstructured":"Chebolu, P., Goldberg, L.A., Martin, R.A.: The Complexity of Approximately Counting Stable Matchings. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol.\u00a06302, pp. 81\u201394. Springer, Heidelberg (2010)"},{"key":"4_CR15","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press (2001)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0165-4896(03)00073-8","volume":"46","author":"V.I. Danilov","year":"2003","unstructured":"Danilov, V.I.: Existence of stable matchings in some three-sided systems. Mathematical Social Sciences\u00a046, 145\u2013148 (2003)","journal-title":"Mathematical Social Sciences"},{"key":"4_CR17","series-title":"LNCS","first-page":"156","volume-title":"WINE 2012","author":"A. Darmann","year":"2012","unstructured":"Darmann, A., Elkind, E., Kurz, S., Lang, J., Schauer, J., Woeginger, G.: Group Activity Selection Problem. In: Goldberg, P.W., Guo, M. (eds.) WINE 2012. LNCS, vol.\u00a07695, pp. 156\u2013169. Springer, Heidelberg (2012)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00355-006-0104-4","volume":"26","author":"D. Dimitrov","year":"2006","unstructured":"Dimitrov, D., Borm, P., Hendrickx, R., Sung, S.-C.: Simple priorities and core stability in hedonic games. Social Choice and Welfare\u00a026, 421\u2013433 (2006)","journal-title":"Social Choice and Welfare"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"J. Dr\u00e8ze","year":"1980","unstructured":"Dr\u00e8ze, J., Greenberg, J.: Hedonic coalitions: Optimality and stability. Econometrica\u00a048, 987\u20131003 (1980)","journal-title":"Econometrica"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"K. Eriksson","year":"2006","unstructured":"Eriksson, K., Sj\u00f6strand, J., Strimling, P.: Three-dimensional stable matching with cyclic preferences. Mathematical Social Sciences\u00a052, 77\u201387 (2006)","journal-title":"Mathematical Social Sciences"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.2307\/1885113","volume":"103","author":"J. Farrell","year":"1988","unstructured":"Farrell, J., Scotchmer, S.: Partnerships. The Quarterly Journal of Economics\u00a0103, 279\u2013297 (1988)","journal-title":"The Quarterly Journal of Economics"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1994","unstructured":"Gale, D., Sotomayor, M.A.O.: Some remarks on the stable matching problem. Discrete Applied Mathematics\u00a011, 223\u2013232 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR24","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"4_CR25","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press (1989)"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"R.W. Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the stable roommates problem. Journal of Algorithms\u00a06, 577\u2013595 (1985)","journal-title":"Journal of Algorithms"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R.W. Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Applied Mathematics\u00a048, 261\u2013272 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R.W. Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM Journal on Computing\u00a015, 655\u2013667 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"R.W. Irving","year":"2002","unstructured":"Irving, R.W., Manlove, D.F.: The stable roommates problem with ties. Journal of Algorithms\u00a043, 85\u2013105 (2002)","journal-title":"Journal of Algorithms"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jda.2008.09.003","volume":"43","author":"R.W. Irving","year":"2009","unstructured":"Irving, R.W., Manlove, D.F., O\u2019Malley, G.: Stable marriage with ties and bounded length preference lists. Journal of Discrete Algorithms\u00a043, 213\u2013219 (2009)","journal-title":"Journal of Discrete Algorithms"},{"key":"4_CR31","unstructured":"Knuth, D.E.: Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires [Stable marriage and its relation to other combinatorial problems]. CRM Proceedings and Lecture Notes, vol. 10. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al (1997)"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D.F. Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science\u00a0276, 261\u2013279 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR33","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C. Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.S.: Three-dimensional stable matching problems. SIAM Journal on Discrete Mathematics\u00a04, 245\u2013252 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4_CR34","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1996.0058","volume":"53","author":"C.H. Papadimitriou","year":"1996","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. Journal of Computer and System Sciences\u00a053, 161\u2013170 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"Ronn, E.: NP-complete stable matching problems. Journal of Algorithms\u00a011, 285\u2013304 (1990)","journal-title":"Journal of Algorithms"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching. Cambridge University Press (1990)","DOI":"10.1017\/CCOL052139015X"},{"key":"4_CR38","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L.S. Shapley","year":"1974","unstructured":"Shapley, L.S., Scarf, H.: On cores and indivisibility. Journal of Mathematical Economics\u00a01, 23\u201337 (1974)","journal-title":"Journal of Mathematical Economics"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/S0097539789169483","volume":"23","author":"A. Subramanian","year":"1994","unstructured":"Subramanian, A.: A new approach to stable matching problems. SIAM Journal on Computing\u00a023, 671\u2013701 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR40","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.orl.2006.03.011","volume":"35","author":"S.-C. Sung","year":"2007","unstructured":"Sung, S.-C., Dimitrov, D.: On core membership testing for hedonic coalition formation games. Operations Research Letters\u00a035, 155\u2013158 (2007)","journal-title":"Operations Research Letters"},{"key":"4_CR41","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ejor.2009.09.004","volume":"203","author":"S.-C. Sung","year":"2010","unstructured":"Sung, S.-C., Dimitrov, D.: Computational complexity in additive hedonic games. European Journal of Operational Research\u00a0203, 635\u2013639 (2010)","journal-title":"European Journal of Operational Research"},{"key":"4_CR42","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0097-3165(93)90051-9","volume":"62","author":"A. Tamura","year":"1993","unstructured":"Tamura, A.: Transformation from arbitrary matchings to stable matchings. Journal of Combinatorial Theory A\u00a062, 310\u2013323 (1993)","journal-title":"Journal of Combinatorial Theory A"},{"key":"4_CR43","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"K. Wagner","year":"1990","unstructured":"Wagner, K.: Bounded query classes. SIAM Journal on Computing\u00a019, 833\u2013846 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: A hardness result for core stability in additive hedonic games. Mathematical Social Sciences (2013)","DOI":"10.1016\/j.mathsocsci.2012.10.001"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2013: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35843-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T12:41:42Z","timestamp":1557492102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35843-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358425","9783642358432"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35843-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}