{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:19:49Z","timestamp":1760300389513,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T00:00:00Z","timestamp":1588032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T00:00:00Z","timestamp":1588032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00224-020-09978-5","type":"journal-article","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T15:03:55Z","timestamp":1588086235000},"page":"579-592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unpopularity Factor in the Marriage and Roommates Problems"],"prefix":"10.1007","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2820-1301","authenticated-orcid":false,"given":"Suthee","family":"Ruangwises","sequence":"first","affiliation":[]},{"given":"Toshiya","family":"Itoh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,28]]},"reference":[{"issue":"2","key":"9978_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1257\/000282805774670167","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E.: The New York City high school match. Amer. Econ. Rev. 95(2), 364\u2013367 (2005)","journal-title":"Amer. Econ. Rev."},{"issue":"2","key":"9978_CR2","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1257\/000282805774669637","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E., S\u00f6nmez, T.: The Boston public school match. Amer. Econ. Rev. 95(2), 368\u2013371 (2005)","journal-title":"Amer. Econ. Rev."},{"key":"9978_CR3","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 424\u2013432 (2005)"},{"key":"9978_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Kavitha, T.: Dynamic matching markets and voting paths. In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), pp. 65\u201376 (2006)","DOI":"10.1007\/11785293_9"},{"key":"9978_CR5","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.: Popular matchings in the marriage and roommates problems. In: Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC), pp. 97\u2013108 (2010)","DOI":"10.1007\/978-3-642-13073-1_10"},{"key":"9978_CR6","unstructured":"Cseh, \u00c1. , Kavitha, T.: Popular matchings in complete graphs. In: Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 17:1\u201317:14 (2018)"},{"issue":"1","key":"9978_CR7","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/3155301","volume":"14","author":"R Duan","year":"2018","unstructured":"Duan, R., Pettie, S., Su, H.-H.: Scaling Algorithms for Weighted Matching in General Graphs. ACM Trans. Algorithm. 14(1), 8:1\u20138:35 (2018)","journal-title":"ACM Trans. Algorithm."},{"key":"9978_CR8","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Kavitha, T., Powers, V., Zhang, X.: Popular matchings and limits to tractability. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2790\u20132809 (2019)","DOI":"10.1137\/1.9781611975482.173"},{"key":"9978_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"9978_CR10","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. Behav. Sci. 20, 166\u2013173 (1975)","journal-title":"Behav. Sci."},{"issue":"3","key":"9978_CR11","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"AV Goldberg","year":"1995","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24(3), 494\u2013504 (1995)","journal-title":"SIAM J. Comput."},{"key":"9978_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, S., Misra, P., Saurabh, S., Zehavi, M.: Popular Matching in Roommates Setting is NP-hard. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2810\u20132822 (2019)","DOI":"10.1137\/1.9781611975482.174"},{"key":"9978_CR13","unstructured":"Gusfield, D., Irving, R.W.: The stable marriage problem: Structure and algorithms. MIT Press (1989)"},{"key":"9978_CR14","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Kavitha, T.: Near-Popular Matchings in the roommates problem. In: Proceedings of the 19th European Symposium on Algorithms (ESA), pp. 167\u2013179 (2011)","DOI":"10.1007\/978-3-642-23719-5_15"},{"key":"9978_CR15","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded unpopularity matchings. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), pp. 127\u2013137 (2008)","DOI":"10.1007\/978-3-540-69903-3_13"},{"key":"9978_CR16","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the \u201cstable roommates\u201d problem. J. Algorithm. 6, 577\u2013595 (1985)","journal-title":"J. Algorithm."},{"key":"9978_CR17","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 (ICALP), pp. 574\u2013584 (2009)","DOI":"10.1007\/978-3-642-02927-1_48"},{"key":"9978_CR18","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of the 7th ACM Conference on Electronic Commerce (EC), pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"issue":"2","key":"9978_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.jda.2008.11.008","volume":"8","author":"D Manlove","year":"2010","unstructured":"Manlove, D., Sng, C.T.S.: Popular matchings in the weighted capacitated house allocation problem. J Discret. Algorithm. 8(2), 102\u2013116 (2010)","journal-title":"J Discret. Algorithm."},{"key":"9978_CR20","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 (LATIN), pp. 593\u2013604 (2008)","DOI":"10.1007\/978-3-540-78773-0_51"},{"key":"9978_CR21","doi-asserted-by":"crossref","unstructured":"Mestre, J.: Weighted popular matchings. In: Proceedings of the 16th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 715\u2013726 (2006)","DOI":"10.1007\/11786986_62"},{"issue":"6","key":"9978_CR22","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE 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(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"key":"9978_CR23","doi-asserted-by":"crossref","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-sided matching: a study in game-theoretic modeling and analysis, volume 18 of Econometric Society Monographs. Cambridge University Press (1990)","DOI":"10.1017\/CCOL052139015X"},{"issue":"5","key":"9978_CR24","doi-asserted-by":"publisher","first-page":"815","DOI":"10.7155\/jgaa.00513","volume":"23","author":"S Ruangwises","year":"2019","unstructured":"Ruangwises, S., Itoh, T.: Random Popular Matchings with Incomplete Preference Lists. J. Graph Algorithm. Appl. 23(5), 815\u2013835 (2019)","journal-title":"J. Graph Algorithm. Appl."},{"key":"9978_CR25","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Unpopularity factor in the marriage and roommates problems. In: Proceedings of the 14th International Computer Science Symposium in Russia (CSR), pp. 337\u2013348 (2019)","DOI":"10.1007\/978-3-030-19955-5_29"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09978-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-09978-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09978-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T08:03:19Z","timestamp":1621584199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-09978-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,28]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9978"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-09978-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2020,4,28]]},"assertion":[{"value":"28 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}