{"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":1778494902395,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130724","type":"print"},{"value":"9783642130731","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_10","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T08:09:58Z","timestamp":1273478998000},"page":"97-108","source":"Crossref","is-referenced-by-count":45,"title":["Popular Matchings in the Marriage and Roommates Problems"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert W.","family":"Irving","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"D.J. Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM Journal on Computing\u00a037, 1030\u20131045 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR2","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":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular matchings in the Marriage and Roommates problems. Technical Report TR-2009-306, University of Glasgow, Department of Computing Science (December 2009)","DOI":"10.1007\/978-3-642-13073-1_10"},{"issue":"2","key":"10_CR4","first-page":"227","volume":"3","author":"L. Chen","year":"2007","unstructured":"Chen, L.: An optimal utility value method with majority equilibrium for public facility allocation. Pacific Journal of Optimization\u00a03(2), 227\u2013234 (2007)","journal-title":"Pacific Journal of Optimization"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"H.N. Gabow","year":"1976","unstructured":"Gabow, H.N.: An efficient implementations of Edmonds\u2019 algorithm for maximum matching on graphs. Journal of the ACM\u00a023(2), 221\u2013234 (1976)","journal-title":"Journal of the ACM"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/jagm.2001.1167","volume":"40","author":"H.N. Gabow","year":"2001","unstructured":"Gabow, H.N., Kaplan, H., Tarjan, R.E.: Unique maximum matching algorithms. Journal of Algorithms\u00a040, 159\u2013183 (2001)","journal-title":"Journal of Algorithms"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences\u00a030, 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H.N. Gabow","year":"1991","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph-matching problems. Journal of the ACM\u00a038(4), 815\u2013853 (1991)","journal-title":"Journal of the ACM"},{"key":"10_CR9","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":"10_CR10","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":"10_CR11","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 Science\u00a020, 166\u2013173 (1975)","journal-title":"Behavioural Science"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing\u00a024(3), 494\u2013504 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR13","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":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-69903-3_13","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"C.-C. Huang","year":"2008","unstructured":"Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded unpopularity matchings. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 127\u2013137. Springer, Heidelberg (2008)"},{"key":"10_CR15","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":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-48523-6_41","volume-title":"Automata, Languages and Programming","author":"K. Iwama","year":"1999","unstructured":"Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 443\u2013452. Springer, Heidelberg (1999)"},{"key":"10_CR17","first-page":"238","volume-title":"Proceedings of EC 2006: the 7th ACM Conference on Electronic Commerce","author":"M. Mahdian","year":"2006","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of EC 2006: the 7th ACM Conference on Electronic Commerce, pp. 238\u2013242. ACM, New York (2006)"},{"issue":"1-2","key":"10_CR18","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":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/11841036_45","volume-title":"Algorithms \u2013 ESA 2006","author":"D.F. Manlove","year":"2006","unstructured":"Manlove, D.F., Sng, C.T.S.: Popular matchings in the Capacitated House Allocation problem. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 492\u2013503. Springer, Heidelberg (2006)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-78773-0_51","volume-title":"LATIN 2008: Theoretical Informatics","author":"R.M. McCutchen","year":"2008","unstructured":"McCutchen, R.M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 593\u2013604. Springer, Heidelberg (2008)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-642-02882-3_50","volume-title":"Computing and Combinatorics","author":"E. McDermid","year":"2009","unstructured":"McDermid, E., Irving, R.W.: Popular matchings: Structure and algorithms. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 506\u2013515. Springer, Heidelberg (2009)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/11786986_62","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.\u00a04051, pp. 715\u2013726. Springer, Heidelberg (2006)"},{"key":"10_CR23","unstructured":"O\u2019Malley, G.: Algorithmic Aspects of Stable Matching Problems. PhD thesis, University of Glasgow, Department of Computing Science (2007)"},{"key":"10_CR24","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"},{"key":"10_CR25","series-title":"Econometric Society Monographs","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. Econometric Society Monographs, vol.\u00a018. Cambridge University Press, Cambridge (1990)"},{"key":"10_CR26","unstructured":"Sng, C.T.S.: Efficient Algorithms for Bipartite Matching Problems with Preferences. PhD thesis, University of Glasgow, Department of Computing Science (2008)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.jda.2008.11.008","volume":"8","author":"C.T.S. Sng","year":"2010","unstructured":"Sng, C.T.S., Manlove, D.F.: Popular matchings in the weighted capacitated house allocation problem. Journal of Discrete Algorithms\u00a08, 102\u2013116 (2010)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T13:19:23Z","timestamp":1635340763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}