{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T04:32:15Z","timestamp":1783485135163,"version":"3.55.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T00:00:00Z","timestamp":1448409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hungarian Scientic Research Fund","award":["K108673"],"award-info":[{"award-number":["K108673"]}]},{"name":"Hungarian Scientic Research Fund","award":["K108383"],"award-info":[{"award-number":["K108383"]}]},{"name":"Janos Bolyai Research Scholarship"},{"name":"Hungarian Scientic Research Fund","award":["K108673"],"award-info":[{"award-number":["K108673"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10472-015-9491-5","type":"journal-article","created":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T15:41:23Z","timestamp":1448466083000},"page":"303-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Matching couples with Scarf\u2019s algorithm"],"prefix":"10.1007","volume":"77","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Fleiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert W.","family":"Irving","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,25]]},"reference":[{"key":"9491_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(96)89151-7","volume":"68","author":"B Aldershof","year":"1996","unstructured":"Aldershof, B., Carducci, O.M.: Stable matchings with couples. Discret. Appl. Math. 68, 203\u2013207 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9491_CR2","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0095-8956(02)00028-X","volume":"87","author":"R Aharoni","year":"2003","unstructured":"Aharoni R., Fleiner T.: On a lemma of Scarf. J. Combin. Theory Ser. B 87(1), 72\u201380 (2003). Dedicated to Crispin St. J. A. Nash-Williams","journal-title":"J. Combin. Theory Ser. B"},{"key":"9491_CR3","unstructured":"Bir\u00f3, P.: University admission practices \u2013 Hungary. matching-in-practice.eu, accessed on (2012)"},{"key":"9491_CR4","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Fleiner, T.: Fractional solutions for capacitated NTU-games, with applications to stable matchings. To appear in Discrete Optimization (2015)","DOI":"10.1016\/j.disopt.2015.02.002"},{"key":"9491_CR5","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Irving, R.W., Schlotter, I.: Stable matching with couples \u2013 an empirical study. ACM Journal of Experimental Algorithmics 16(Article No.: 1.2) (2011)","DOI":"10.1145\/1963190.1970372"},{"issue":"2","key":"9491_CR6","doi-asserted-by":"publisher","first-page":"1340008","DOI":"10.1142\/S0219198913400082","volume":"15","author":"P Bir\u00f3","year":"2013","unstructured":"Bir\u00f3, P., Klijn, F.: Matching with Couples: A Multidisciplinary Survey. International Game Theory Review 15(2), 1340008 (2013)","journal-title":"International Game Theory Review"},{"key":"9491_CR7","doi-asserted-by":"publisher","unstructured":"Bir\u00f3, P., Kiselgof, S.: College admissions with stable score-limits. Central European Journal of Operations Research 23(4), 727\u2013741 (2015)","DOI":"10.1007\/s10100-013-0320-9"},{"issue":"1","key":"9491_CR8","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. Amer. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Amer. Math. Monthly"},{"key":"9491_CR9","doi-asserted-by":"crossref","unstructured":"Irving, R.W.: Matching medical students to pairs of hospitals: a new variation on an old theme. In: Proceedings of ESA\u201998 LNCS, vol. 1461, pp. 381\u2013392 (1998)","DOI":"10.1007\/3-540-68530-8_32"},{"key":"9491_CR10","unstructured":"Irving, R.W.: Matching practices for entry-labor markets - Scotland. matching-in-practice.eu, accessed on (2012)"},{"key":"9491_CR11","unstructured":"Kintali, S.: Complexity of Scarf\u2019s Lemma and Related Problems. Working paper (2009)"},{"issue":"1","key":"9491_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jet.2004.04.006","volume":"121","author":"B Klaus","year":"2005","unstructured":"Klaus, B., Klijn, F.: Stable matchings and preferences of couples. J. Econom. Theory 121(1), 75\u2013106 (2005)","journal-title":"J. Econom. Theory"},{"key":"9491_CR13","first-page":"175","volume":"11","author":"B Klaus","year":"2007","unstructured":"Klaus, B., Klijn, F., Mass\u00f3, J.: Some things couples always wanted to know about stable matchings (but were afraid to ask). Rev. Econ. Des. 11, 175\u2013184 (2007)","journal-title":"Rev. Econ. Des."},{"issue":"4","key":"9491_CR14","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1093\/qje\/qjt019","volume":"128","author":"F Kojima","year":"2013","unstructured":"Kojima, F., Pathak, P.A., Roth, A.E., Matching with couples: Stability and incentives in large markets. Q. J. Econ. 128(4), 1585\u20131632 (2013)","journal-title":"Q. J. Econ."},{"key":"9491_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.disopt.2010.07.004","volume":"8","author":"D Marx","year":"2011","unstructured":"Marx, D., Schlotter, I.: Stable assignment with couples: parameterized complexity and local search. Discret. Optim. 8, 25\u201340 (2011)","journal-title":"Discret. Optim."},{"key":"9491_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"E McDermid","year":"2010","unstructured":"McDermid, E., Manlove, D.F.: Keeping partners together: Algorithmic results for the hospitals \/ residents problem with couples. J. Comb. Optim. 19, 279\u2013303 (2010)","journal-title":"J. Comb. Optim."},{"key":"9491_CR17","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Vohra, R.: Near Feasible Stable Matchings with Complementarities. Working paper (2014)","DOI":"10.2139\/ssrn.2500824"},{"key":"9491_CR18","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 11, 285\u2013304 (1990)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"9491_CR19","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"6","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 6(4), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"issue":"4","key":"9491_CR20","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1257\/aer.89.4.748","volume":"89","author":"AE Roth","year":"1999","unstructured":"Roth, A.E., Peranson, E.: The redesign of the matching market for American physicians: Some engineering aspects of economic design. Am. Econ. Rev. 89(4), 748\u2013780 (1999)","journal-title":"Am. Econ. Rev."},{"key":"9491_CR21","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00182-008-0117-6","volume":"36","author":"AE Roth","year":"2008","unstructured":"Roth, A.E.: Deferred acceptance algorithms: history, theory, practice, and open questions. Int. J. Game Theory 36, 537\u2013569 (2008)","journal-title":"Int. J. Game Theory"},{"key":"9491_CR22","doi-asserted-by":"publisher","first-page":"50","DOI":"10.2307\/1909383","volume":"35","author":"HE Scarf","year":"1967","unstructured":"Scarf, H.E.: The core of an N person game. Econometrica 35, 50\u201369 (1967)","journal-title":"Econometrica"},{"key":"9491_CR23","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1287\/moor.1060.0207","volume":"31","author":"J Sethuraman","year":"2006","unstructured":"Sethuraman, J., Teo, C-P., Qian, L.: Many-to-one stable matching: geometry and fairness. Math. Oper. Res. 31, 581\u2013596 (2006)","journal-title":"Math. Oper. Res."},{"key":"9491_CR24","unstructured":"(National Resident Matching Program website), accessed on 23 May 2012. http:\/\/www.nrmp.org\/about_nrmp\/how.html"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9491-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-015-9491-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9491-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T22:46:18Z","timestamp":1567377978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-015-9491-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,25]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9491"],"URL":"https:\/\/doi.org\/10.1007\/s10472-015-9491-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,25]]}}}