{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T14:19:17Z","timestamp":1782224357009,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540322078","type":"print"},{"value":"9783540322085","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_1","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"1-14","source":"Crossref","is-referenced-by-count":32,"title":["\u201cAlmost Stable\u201d Matchings in the Roommates Problem"],"prefix":"10.1007","author":[{"given":"David J.","family":"Abraham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1077464.1077474","volume":"1","author":"K. Cechl\u00e1rov\u00e1","year":"2005","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: On a generalization of the stable roommates problem. ACM Transactions on Algorithms\u00a01(1), 143\u2013156 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"1_CR2","unstructured":"Eriksson, K., Strimling, P.: How unstable are matchings from decentralized mate search? (preprint, 2005) (Submitted for publication)"},{"key":"1_CR3","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":"1_CR4","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.3190070302","volume":"7","author":"F. Harary","year":"1983","unstructured":"Harary, F.: Maximum versus minimum invariants for graphs. J. Graph Theory\u00a07, 275\u2013284 (1983)","journal-title":"J. Graph Theory"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"J.D. Horton","year":"1993","unstructured":"Horton, J.D., Kilakos, K.: Minimum edge dominating sets. SIAM J. Discrete Mathematics\u00a06, 375\u2013387 (1993)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"1_CR7","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 \u201cstable roommates\u201d problem. J. Algorithms\u00a06, 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"key":"1_CR8","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. J. Algorithms\u00a043, 85\u2013105 (2002)","journal-title":"J. Algorithms"},{"key":"1_CR9","unstructured":"Knuth, D.E.: Mariages Stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al (1976)"},{"issue":"1","key":"1_CR10","first-page":"19","volume":"7","author":"E. Kujansuu","year":"1999","unstructured":"Kujansuu, E., Lindberg, T., M\u00e4kinen, E.: The stable roommates problem and chess tournament pairings. Divulgaciones Matem\u00e1ticas\u00a07(1), 19\u201328 (1999)","journal-title":"Divulgaciones Matem\u00e1ticas"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Niederle, M., Roth, A.E.: Market culture: How norms governing explording offers affect market performance. NBER working paper 10256 (January 2004)","DOI":"10.3386\/w10256"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/rsa.3240050307","volume":"5","author":"B.G. Pittel","year":"1994","unstructured":"Pittel, B.G., Irving, R.W.: An upper bound for the solvability probability of a random stable roommates instance. Rand. Struct. Algorithms\u00a05(3), 465\u2013486 (1994)","journal-title":"Rand. Struct. Algorithms"},{"key":"1_CR13","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. J. Algorithms\u00a011, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"key":"1_CR14","unstructured":"Roth, A.E., S\u00f6nmez, T., Utku \u00dcnver, M.: Pairwise kidney exchange. Journal of Economic Theory (to appear)"},{"key":"1_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching: a study in game-theoretic modeling and analysis","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge (1990)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0196-6774(91)90028-W","volume":"12","author":"J.J.M. Tan","year":"1991","unstructured":"Tan, J.J.M.: A necessary and sufficient condition for the existence of a complete stable matching. J. Algorithms\u00a012, 154\u2013178 (1991)","journal-title":"J. Algorithms"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1080\/00207169108803975","volume":"39","author":"J.J.M. Tan","year":"1991","unstructured":"Tan, J.J.M.: Stable matchings and stable partitions. International J. Computer Mathematics\u00a039, 11\u201320 (1991)","journal-title":"International J. Computer Mathematics"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:18Z","timestamp":1619507658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11671411_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}