{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:58:14Z","timestamp":1779908294954,"version":"3.53.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,30]],"date-time":"2010-07-30T00:00:00Z","timestamp":1280448000000},"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":[[2011,11]]},"DOI":"10.1007\/s00453-010-9434-9","type":"journal-article","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T22:01:14Z","timestamp":1280440874000},"page":"738-757","source":"Crossref","is-referenced-by-count":10,"title":["Bounded Unpopularity Matchings"],"prefix":"10.1007","volume":"61","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitrios","family":"Michail","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meghana","family":"Nasre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,7,30]]},"reference":[{"issue":"3","key":"9434_CR1","doi-asserted-by":"crossref","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 66(3), 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"9434_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto-optimality in house allocation problems. In: Proceedings of 15th Annual International Symposium on Algorithms and Computation. pp.\u00a03\u201315 (2004)","DOI":"10.1007\/978-3-540-30551-4_3"},{"issue":"4","key":"9434_CR3","doi-asserted-by":"crossref","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 J. Comput. 37(4), 1030\u20131045 (2007)","journal-title":"SIAM J. Comput."},{"key":"9434_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201314 (1962)","journal-title":"Am. Math. Mon."},{"key":"9434_CR5","doi-asserted-by":"crossref","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. Behav. Sci. 20, 166\u2013173 (1975)","journal-title":"Behav. Sci."},{"key":"9434_CR6","first-page":"179","volume-title":"The Handbook of Combinatorics","year":"1995","unstructured":"Graham, R.L., Grotschel, M., Lovasz, L. (eds.) The Handbook of Combinatorics, vol.\u00a01, pp. 179\u2013232. Elsevier Science, Amsterdam (1995). Chap. 3, Matchings and extensions"},{"key":"9434_CR7","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)"},{"issue":"22","key":"9434_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A. Hylland","year":"1979","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(22), 293\u2013314 (1979)","journal-title":"J. Polit. Econ."},{"key":"9434_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R.W. Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48, 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9434_CR10","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"R.W. Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Trans. Algorithms 2(4), 602\u2013610 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9434_CR11","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pp. 574\u2013584 (2009)","DOI":"10.1007\/978-3-642-02927-1_48"},{"issue":"14","key":"9434_CR12","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1016\/j.dam.2009.06.004","volume":"157","author":"T. Kavitha","year":"2009","unstructured":"Kavitha, T., Nasre, M.: Note: optimal popular matchings. Discrete Appl. Math. 157(14), 3181\u20133186 (2009)","journal-title":"Discrete Appl. Math."},{"key":"9434_CR13","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Nasre, M.: Popular matchings with variable job capacities. In: Proceedings of 20th Annual International Symposium on Algorithms and Computation, pp. 423\u2013433 (2009)","DOI":"10.1007\/978-3-642-10631-6_44"},{"key":"9434_CR14","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"9434_CR15","doi-asserted-by":"crossref","unstructured":"Manlove, D., Sng, C.: Popular matchings in the capacitated house allocation problem. In: Proceedings of the 14th Annual European Symposium on Algorithms, pp. 492\u2013503 (2006)","DOI":"10.1007\/11841036_45"},{"key":"9434_CR16","doi-asserted-by":"crossref","unstructured":"McCutchen, R.M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Proceedings of the 15th Latin American Symposium on Theoretical Informatics, pp. 593\u2013604 (2008)","DOI":"10.1007\/978-3-540-78773-0_51"},{"key":"9434_CR17","doi-asserted-by":"crossref","unstructured":"McDermid, E., Irving, R.W.: Popular matchings: Structure and algorithms. In: Proceedings of 15th Annual International Computing and Combinatorics Conference, pp. 506\u2013515 (2009)","DOI":"10.1007\/978-3-642-02882-3_50"},{"key":"9434_CR18","doi-asserted-by":"crossref","unstructured":"Mestre, J.: Weighted popular matchings. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, pp. 715\u2013726 (2006)","DOI":"10.1007\/11786986_62"},{"key":"9434_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-4068(77)90004-0","volume":"4","author":"A.E. Roth","year":"1977","unstructured":"Roth, A.E., Postlewaite, A.: Weak versus strong domination in a market with indivisible goods. J.\u00a0Math. Econ. 4, 131\u2013137 (1977)","journal-title":"J.\u00a0Math. Econ."},{"key":"9434_CR20","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/0377-2217(94)00358-0","volume":"90","author":"Y. Yuan","year":"1996","unstructured":"Yuan, Y.: Residence exchange wanted: a stable residence exchange problem. Eur. J. Oper. Res. 90, 536\u2013546 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9434_CR21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0022-0531(90)90070-Z","volume":"52","author":"L. Zhou","year":"1990","unstructured":"Zhou, L.: On a conjecture by gale about one-sided matching problems. J. Econ. Theory 52(1), 123\u2013135 (1990)","journal-title":"J. Econ. Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9434-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9434-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9434-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:47:17Z","timestamp":1559350037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9434-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,30]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9434"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9434-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,30]]}}}