{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:51:38Z","timestamp":1742975498782,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699002"},{"type":"electronic","value":"9783540699033"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69903-3_13","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"127-137","source":"Crossref","is-referenced-by-count":16,"title":["Bounded Unpopularity Matchings"],"prefix":"10.1007","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meghana","family":"Nasre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Mehlhorn, K.: Pareto-optimality in house allocation problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 3\u201315. Springer, Heidelberg (2004)"},{"issue":"4","key":"13_CR2","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 Journal on Computing\u00a037(4), 1030\u20131045 (2007), Preliminary version. In: Proc. of 16th SODA, pp. 424-432, (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"13_CR3","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(3), 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded Unpopularity Matchings. Dartmouth Computer Science, Technical Report (2008)-616","DOI":"10.1007\/978-3-540-69903-3_13"},{"key":"13_CR5","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":"13_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P. Gardenfors","year":"1975","unstructured":"Gardenfors, P.: Match making: assignments based on bilateral preferences. Behavioural Sciences\u00a020, 166\u2013173 (1975)","journal-title":"Behavioural Sciences"},{"key":"13_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)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: A n 5\/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","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. Journal of Political Economy\u00a087(2), 293\u2013314 (1979)","journal-title":"Journal of Political Economy"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","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 Transactions on Algorithms\u00a02(4), 602\u2013610 (2006), Preliminary version. In: Proc. of 15th SODA, pp. 68-75 (2004)","journal-title":"ACM Transactions on Algorithms"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of the 7th ACM Conference on Electronic-Commerce, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"13_CR12","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.: 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":"13_CR13","unstructured":"McCutchen, M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Proceedings of LATIN 2008, the 8th Latin American Theoretical Informatics Symposium, LNCS, vol. 4957, Springer, Heidelberg (2008)"},{"key":"13_CR14","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":"13_CR15","doi-asserted-by":"publisher","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. Journal of Mathematical Economics\u00a04, 131\u2013137 (1977)","journal-title":"Journal of Mathematical Economics"},{"key":"13_CR16","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a090, 536\u2013546 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","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. Journal of Economic Theory\u00a052(1), 123\u2013135 (1990)","journal-title":"Journal of Economic Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69903-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:09:01Z","timestamp":1738325341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69903-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699002","9783540699033"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69903-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}