{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:41:35Z","timestamp":1772296895304,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642346101","type":"print"},{"value":"9783642346118","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_10","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T04:42:25Z","timestamp":1350880945000},"page":"69-80","source":"Crossref","is-referenced-by-count":11,"title":["Solutions for the Stable Roommates Problem with Payments"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[]},{"given":"Matthijs","family":"Bomhoff","sequence":"additional","affiliation":[]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11671411_1","volume-title":"Approximation and Online Algorithms","author":"D.J. Abraham","year":"2006","unstructured":"Abraham, D.J., Bir\u00f3, P., Manlove, D.F.: \u201cAlmost Stable\u201d Matchings in the Roommates Problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 1\u201314. Springer, Heidelberg (2006)"},{"key":"10_CR2","unstructured":"B\u00e9al, S., R\u00e9mila, E., Solal, P.: On the number of blocks required to access the coalition structure core. Working Paper, Munich Personal RePEc Archive, MPRA Paper No. 29755 (2011)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00182-011-0273-y","volume":"41","author":"P. Bir\u00f3","year":"2012","unstructured":"Bir\u00f3, P., Kern, W., Paulusma, D.: Computing solutions for matching games. International Journal of Game Theory\u00a041, 75\u201390 (2012)","journal-title":"International Journal of Game Theory"},{"key":"10_CR4","unstructured":"Chen, B., Fujishige, S., Yang, Z.: Decentralized Market Processes to Stable Job Matchings with Competitive Salaries. Working Paper, Kyoto University, RIMS-1715 (2011)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.geb.2003.05.003","volume":"48","author":"E. Diamantoudi","year":"2004","unstructured":"Diamantoudi, E., Miyagawa, E., Xue, L.: Random paths to stability in the roommates problem. Games and Economic Behavior\u00a048, 18\u201328 (2004)","journal-title":"Games and Economic Behavior"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s001820000058","volume":"29","author":"K. Eriksson","year":"2001","unstructured":"Eriksson, K., Karlander, J.: Stable outcomes of the roommate game with transferable utility. International Journal of Game Theory\u00a029, 555\u2013569 (2001)","journal-title":"International Journal of Game Theory"},{"key":"10_CR7","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":"10_CR8","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":"10_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR10","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Soviet Mathematics Doklady\u00a020, 191\u2013194 (1979)","journal-title":"Soviet Mathematics Doklady"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.geb.2003.06.006","volume":"48","author":"L.\u00c1. K\u00f3czy","year":"2004","unstructured":"K\u00f3czy, L.\u00c1., Lauwers, L.: The coalition structure core is accessible. Games and Economic Behavior\u00a048, 86\u201393 (2004)","journal-title":"Games and Economic Behavior"},{"key":"10_CR12","volume-title":"Mariages stable et leurs relations avec d\u2019autres probl\u00e8mes combinatoires","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: Mariages stable et leurs relations avec d\u2019autres probl\u00e8mes combinatoires. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1976)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.2307\/2938326","volume":"58","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Vande Vate, J.H.: Random paths to stability in two-sided matching. Econometrica\u00a058, 1475\u20131480 (1990)","journal-title":"Econometrica"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L.S. Shapley","year":"1972","unstructured":"Shapley, L.S., Shubik, M.: The assignment game I: the core. International Journal of Game Theory\u00a01, 111\u2013130 (1972)","journal-title":"International Journal of Game Theory"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.mathsocsci.2011.04.008","volume":"62","author":"Y.-Y. Yang","year":"2011","unstructured":"Yang, Y.-Y.: Accessible outcomes versus absorbing outcomes. Mathematical Social Sciences\u00a062, 65\u201370 (2011)","journal-title":"Mathematical Social Sciences"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:00:37Z","timestamp":1620118837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}