{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:17:17Z","timestamp":1761895037366},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T00:00:00Z","timestamp":1265846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00453-010-9388-y","type":"journal-article","created":{"date-parts":[[2010,2,10]],"date-time":"2010-02-10T15:35:45Z","timestamp":1265816145000},"page":"188-220","source":"Crossref","is-referenced-by-count":26,"title":["A Polynomial-Time Algorithm to Find von\u00a0Neumann-Morgenstern Stable Matchings in\u00a0Marriage Games"],"prefix":"10.1007","volume":"58","author":[{"given":"Jun","family":"Wako","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,11]]},"reference":[{"key":"9388_CR1","doi-asserted-by":"crossref","first-page":"1954","DOI":"10.1257\/aer.99.5.1954","volume":"99","author":"A. Abdulkadiro\u011flu","year":"2009","unstructured":"Abdulkadiro\u011flu, A., Parag, A., Roth, A.E.: Strategy-proofness versus efficiency in matching with indifferences: Redesigning the NYC high school match. Am. Econ. Rev. 99, 1954\u20131978 (2009)","journal-title":"Am. Econ. Rev."},{"key":"9388_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2005.06.003","volume":"152","author":"K. Cechl\u00e1rov\u00e1","year":"2005","unstructured":"Cechl\u00e1rov\u00e1, K., Manlove, D.: The exchange-stable marriage problem. Discrete Appl. Math. 152, 109\u2013122 (2005)","journal-title":"Discrete Appl. Math."},{"key":"9388_CR3","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/j.jet.2006.03.006","volume":"134","author":"L. Ehlers","year":"2007","unstructured":"Ehlers, L.: Von Neumann-Morgenstern stable sets in matching problems. J. Econ. Theory 134, 537\u2013547 (2007)","journal-title":"J. Econ. Theory"},{"key":"9388_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"9388_CR5","doi-asserted-by":"crossref","first-page":"9","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 Appl. Math. 11, 9\u201315 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9388_CR6","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"G. Gusfield","year":"1989","unstructured":"Gusfield, G., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"9388_CR7","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1287\/mnsc.20.11.1472","volume":"20","author":"J. Harsanyi","year":"1974","unstructured":"Harsanyi, J.: An equilibrium-point interpretation of stable sets and a proposed alternative definition. Manag. Sci. 20, 1472\u20131495 (1974)","journal-title":"Manag. Sci."},{"key":"9388_CR8","unstructured":"Kesten, O.: School choice with consent. Discussion paper (2008). Q. J. Econ. (to appear)"},{"key":"9388_CR9","volume-title":"Marriages Stables","author":"D. Knuth","year":"1976","unstructured":"Knuth, D.: Marriages Stables. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal (1976). [English edition, the American Mathematical Society, Providence, 1996]"},{"key":"9388_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01934199","volume":"10","author":"D.G. McVitie","year":"1970","unstructured":"McVitie, D.G., Wilson, L.B.: Stable marriage assignments for unequal sets. BIT 10, 295\u2013309 (1970)","journal-title":"BIT"},{"key":"9388_CR11","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1090\/S0002-9904-1975-13672-X","volume":"81","author":"A.E. Roth","year":"1975","unstructured":"Roth, A.E.: A lattice fixed-point theorem with constraints. Bull. Am. Math. Soc. 81, 136\u2013138 (1975)","journal-title":"Bull. Am. Math. Soc."},{"key":"9388_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.1.1.43","volume":"1","author":"A.E. Roth","year":"1976","unstructured":"Roth, A.E.: Subsolutions and the supercore of cooperative games. Math. Oper. Res. 1, 43\u201349 (1976)","journal-title":"Math. Oper. Res."},{"key":"9388_CR13","doi-asserted-by":"crossref","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. J. Polit. Econ. 92, 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"key":"9388_CR14","doi-asserted-by":"crossref","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.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge Univ. Press, New York (1990)"},{"key":"9388_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L. Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibilities. J. Math. Econ. 1, 23\u201328 (1974)","journal-title":"J. Math. Econ."},{"key":"9388_CR16","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann Von","year":"1953","unstructured":"Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton Univ. Press, Princeton (1953)"},{"key":"9388_CR17","unstructured":"Wako, J.: A note on existence and uniqueness of vNM stable sets marriage games. In: Match-UP Workshop Proceedings of ICALP 2008, pp.\u00a0157\u2013168 (2008)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9388-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9388-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:05Z","timestamp":1559137505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9388-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9388-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,11]]}}}