{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:14:56Z","timestamp":1725524096253},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540939795"},{"type":"electronic","value":"9783540939801"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-93980-1_2","type":"book-chapter","created":{"date-parts":[[2009,1,12]],"date-time":"2009-01-12T05:12:21Z","timestamp":1231737141000},"page":"15-28","source":"Crossref","is-referenced-by-count":1,"title":["Size Versus Stability in the Marriage Problem"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shubham","family":"Mittal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1257\/000282803322157061","volume":"93","author":"A. Abdulkadiro\u01e7luand","year":"2003","unstructured":"Abdulkadiro\u01e7luand, A., S\u00f6nmez, T.: School choice: A mechanism design approach. American Economic Review\u00a093(3), 729\u2013747 (2003)","journal-title":"American Economic Review"},{"key":"2_CR2","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)"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2006.03.006","volume":"5","author":"D.J. Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the Student-Project allocation problem. Journal of Discrete Algorithms\u00a05(1), 79\u201391 (2007)","journal-title":"Journal of Discrete Algorithms"},{"key":"2_CR4","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Scott Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity Report, number 49 (2003)"},{"key":"2_CR5","unstructured":"Bir\u00f3, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Technical Report TR-2008-283, University of Glasgow, Department of Computing Science (2008)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Eriksson, K., H\u00e4ggstr\u00f6m, O.: Instability of matchings in decentralized markets with various preference structures. International Journal of Game Theory (2008)","DOI":"10.1007\/s00182-007-0081-6"},{"key":"2_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":"2_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics\u00a011, 223\u2013232 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR9","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":"2_CR10","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. Journal of Algorithms\u00a06, 577\u2013595 (1985)","journal-title":"Journal of Algorithms"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/3-540-68530-8_32","volume-title":"Algorithms - ESA \u201998","author":"R.W. Irving","year":"1998","unstructured":"Irving, R.W.: Matching medical students to pairs of hospitals: A new variation on a well-known theme. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 381\u2013392. Springer, Heidelberg (1998)"},{"issue":"3","key":"2_CR12","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(3), 655\u2013667 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR13","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":"2_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science\u00a0127, 255\u2013267 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"2_CR15","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"},{"issue":"1-2","key":"2_CR16","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(1-2), 261\u2013279 (2002)","journal-title":"Theoretical Computer Science"},{"key":"2_CR17","unstructured":"O\u2019Malley, G.: Algorithmic Aspects of Stable Matching Problems. PhD thesis, University of Glasgow, Department of Computing Science (2007)"},{"key":"2_CR18","unstructured":"Robards, P.A.: Applying two-sided matching processes to the united states navy enlisted assignment process. Master\u2019s thesis, Naval Postgraduate School, Monterey, California (2001)"},{"key":"2_CR19","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"},{"issue":"6","key":"2_CR20","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A.E. Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy\u00a092(6), 991\u20131016 (1984)","journal-title":"Journal of Political Economy"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"A.E. Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., Utku \u00dcnver, M.: Kidney exchange. Quarterly Journal of Economics\u00a0119, 457\u2013488 (2004)","journal-title":"Quarterly Journal of Economics"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"A.E. Roth","year":"2005","unstructured":"Roth, A.E., S\u00f6nmez, T., Utku \u00dcnver, M.: Pairwise kidney exchange. Journal of Economic Theory\u00a0125, 151\u2013188 (2005)","journal-title":"Journal of Economic Theory"},{"key":"2_CR23","unstructured":"Yang, W., Giampapa, J.A., Sycara, K.: Two-sided matching for the U.S. Navy Detailing Process with market complication. Technical Report CMU-RI-TR-03-49, Robotics Institute, Carnegie-Mellon University (2003)"},{"key":"2_CR24","unstructured":"http:\/\/www.nrmp.org\n                    \n                    \n                   (National Resident Matching Program website)"},{"key":"2_CR25","unstructured":"http:\/\/www.carms.ca\n                    \n                    \n                   (Canadian Resident Matching Service website)"},{"key":"2_CR26","unstructured":"http:\/\/www.nes.scot.nhs.uk\/sfas\n                    \n                    \n                   (Scottish Foundation Allocation Scheme website)"},{"key":"2_CR27","unstructured":"http:\/\/www.nepke.org\n                    \n                    \n                   (New England Program for Kidney Exchange website)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-93980-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T21:11:06Z","timestamp":1551733866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-93980-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540939795","9783540939801"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-93980-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}