{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:46:52Z","timestamp":1743086812095,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_16","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:07:44Z","timestamp":1286957264000},"page":"174-185","source":"Crossref","is-referenced-by-count":22,"title":["Computing Stable Outcomes in Hedonic Games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gairing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E.H.L. Aarts","year":"1997","unstructured":"Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley Interscience, Hoboken (1997)"},{"doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Improved equilibria via public service advertising. In: SODA, pp. 728\u2013737 (2009)","key":"16_CR2","DOI":"10.1137\/1.9781611973068.80"},{"issue":"1","key":"16_CR3","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), 1\u201330 (2004)","journal-title":"Games and Economic Behavior"},{"doi-asserted-by":"crossref","unstructured":"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\u2013146 (2010)","key":"16_CR4","DOI":"10.1145\/1807342.1807353"},{"issue":"2","key":"16_CR5","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(2), 201\u2013230 (2002)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0165-4896(02)00082-3","volume":"45","author":"N. Burani","year":"2003","unstructured":"Burani, N., Zwicker, W.S.: Coalition formation games with separable preferences. Mathematical Social Sciences\u00a045(1), 27\u201352 (2003)","journal-title":"Mathematical Social Sciences"},{"key":"16_CR7","volume-title":"Encyclopedia of Algorithms","author":"K. Cechl\u00e1rov\u00e1","year":"2008","unstructured":"Cechl\u00e1rov\u00e1, K.: Stable partition problem. In: Encyclopedia of Algorithms. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: STACS, pp. 349\u2013360 (2006)","key":"16_CR8","DOI":"10.1007\/11672142_28"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"J.H. Dreze","year":"1980","unstructured":"Dreze, J.H., Greenberg, J.: Hedonic coalitions: Optimality and stability. Econometrica\u00a048(4), 987\u20131003 (1980)","journal-title":"Econometrica"},{"unstructured":"Elkind, E., Wooldridge, M.: Hedonic coalition nets. In: Int. Conference on Autonomous Agents and Multiagent Systems, pp. 417\u2013424 (2009)","key":"16_CR10"},{"key":"16_CR11","volume-title":"Handbook of Game Theory with Economic Applications II","author":"J. Greenberg","year":"1994","unstructured":"Greenberg, J.: Coalition structures. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory with Economic Applications II. Elsevier, Amsterdam (1994)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences\u00a037, 79\u2013100 (1988)","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"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)","key":"16_CR13","DOI":"10.1007\/978-3-642-13073-1_24"},{"doi-asserted-by":"crossref","unstructured":"Monien, B., Dumrauf, D., Tscheuschner, T.: Local search: Simple, successful, but sometimes sluggish. In: 37th International Colloquium on Automata, Languages and Programming, ICALP (2010)","key":"16_CR14","DOI":"10.1007\/978-3-642-14165-2_1"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/S0097539703431007","volume":"33","author":"J.B. Orlin","year":"2004","unstructured":"Orlin, J.B., Punnen, A.P., Schulz, A.S.: Approximate local search in combinatorial optimization. SIAM Journal of Computing\u00a033(5), 1201\u20131214 (2004)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A.A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple Local Search Problems that are Hard to Solve. SIAM Journal of Computing\u00a020(1), 56\u201387 (1991)","journal-title":"SIAM Journal of Computing"},{"unstructured":"Sipser, M.: Introduction to the Theory of Computation. Thomson (2006)","key":"16_CR17"},{"issue":"3","key":"16_CR18","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(3), 635\u2013639 (2010)","journal-title":"European Journal of Operational Research"},{"unstructured":"Tscheuschner, T.: The local max-cut problem is PLS-complete even on graphs with maximum degree five (2010), http:\/\/arxiv.org\/abs\/1004.5329","key":"16_CR19"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:21:05Z","timestamp":1559722865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}