{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:21:42Z","timestamp":1778494902554,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_45","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"492-503","source":"Crossref","is-referenced-by-count":32,"title":["Popular Matchings in the Capacitated House Allocation Problem"],"prefix":"10.1007","author":[{"given":"David F.","family":"Manlove","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin T. S.","family":"Sng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A. Abdulkadiro\u01e7lu","year":"1998","unstructured":"Abdulkadiro\u01e7lu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica\u00a066, 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-30551-4_3","volume-title":"Algorithms and Computation","author":"D.J. Abraham","year":"2004","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Melhorn, K.: Pareto optimality in house allocation problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 3\u201315. Springer, Heidelberg (2004)"},{"key":"45_CR3","first-page":"424","volume-title":"Proceedings of SODA 2005","author":"D.J. Abraham","year":"2005","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Melhorn, K.: Popular matchings. In: Proceedings of SODA 2005, pp. 424\u2013432. ACM-SIAM, New York (2005)"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11785293_9","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"D.J. Abraham","year":"2006","unstructured":"Abraham, D.J., Kavitha, T.: Dynamic matching markets and voting paths. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 65\u201376. Springer, Heidelberg (2006)"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proceedings of STOC 1983, pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P. G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors, P.: Match making: Assignments based on bilateral preferences. Behavioural Sciences\u00a020, 166\u2013173 (1975)","journal-title":"Behavioural Sciences"},{"key":"45_CR7","first-page":"68","volume-title":"Proceedings of SODA 2004","author":"R.W. Irving","year":"2004","unstructured":"Irving, R.W., Kavitha, T., Melhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. In: Proceedings of SODA 2004, pp. 68\u201375. ACM-SIAM, New York (2004)"},{"key":"45_CR8","first-page":"238","volume-title":"Proceedings of EC 2006","author":"M. Mahdian","year":"2006","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of EC 2006, pp. 238\u2013242. ACM-SIAM, New York (2006)"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Manlove, D.F., Sng, C.T.S.: Popular matchings in the Capacitated House Allocation Problem. Technical Report TR-2006-222, University of Glasgow, Department of Computing Science (June 2006)","DOI":"10.1007\/11841036_45"},{"key":"45_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"J. Mestre","year":"2006","unstructured":"Mestre, J.: Weighted popular matchings. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052. Springer, Heidelberg (2006)"},{"key":"45_CR11","first-page":"179","volume-title":"The Handbook of Combinatorics, Ch. 3","author":"W.R. Pulleyblank","year":"1995","unstructured":"Pulleyblank, W.R.: Matchings and Extensions. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) The Handbook of Combinatorics, ch. 3, vol.\u00a01, pp. 179\u2013232. North Holland, Amsterdam (1995)"},{"key":"45_CR12","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, 991\u20131016 (1984)","journal-title":"Journal of Political Economy"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:32Z","timestamp":1605642032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11841036_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}