{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:54Z","timestamp":1759637934468,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_40","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"504-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Maintaining Near-Popular Matchings"],"prefix":"10.1007","author":[{"given":"Sayan","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien-Chung","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"4","key":"40_CR1","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"D Abraham","year":"2007","unstructured":"Abraham, D., Irving, R., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37(4), 1030\u20131045 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"40_CR2","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1137\/080724125","volume":"24","author":"D Abraham","year":"2010","unstructured":"Abraham, D., Kavitha, T.: Voting paths. SIAM J. Disc. Math. 24(2), 520\u2013537 (2010)","journal-title":"Voting paths. SIAM J. Disc. Math."},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1137\/090753498","volume":"40","author":"H Ackermann","year":"2011","unstructured":"Ackermann, H., Goldberg, P., Mirrokni, V., R\u00f6glin, H., V\u00f6cking, B.: Uncoordinated two-sided matching markets. SIAM J. Comput. 40(1), 92\u2013106 (2011)","journal-title":"SIAM J. Comput."},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Baswana, S., Gupta, M., Sen, S.: Fully dynamic maximal matching in $$O(\\log n)$$ update time. In: Proc. 52nd Symp. Foundations of Computer Science (FOCS), pp. 383\u2013392 (2011)","DOI":"10.1109\/FOCS.2011.89"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Henzinger, M., Italiano, G.: Deterministic fully dynamic data structures for vertex cover and matching. In: Proc. 25th Symp. Discrete Algorithms (SODA), pp. 785\u2013804 (2015)","DOI":"10.1137\/1.9781611973730.54"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-13073-1_10","volume-title":"Algorithms and Complexity","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 97\u2013108. Springer, Heidelberg (2010)"},{"issue":"1","key":"40_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.geb.2003.05.003","volume":"48","author":"E Diamantoudi","year":"2004","unstructured":"Diamantoudi, E., Miyagawa, E., Xue, L.: Random paths to stability in the roommates problem. Games Econom. Behav. 48(1), 18\u201328 (2004)","journal-title":"Games Econom. Behav."},{"key":"40_CR8","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 20, 166\u2013173 (1975)","journal-title":"Behavioural Sciences"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, M., Peng, R.: Fully dynamic (1+$$\\varepsilon $$)-approximate matchings. In: Proc. 54th Symp. Foundations of Computer Science (FOCS), pp. 548\u2013557 (2013)","DOI":"10.1109\/FOCS.2013.65"},{"key":"40_CR10","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press (1989)"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ic.2012.10.005","volume":"222","author":"M Hoefer","year":"2013","unstructured":"Hoefer, M.: Local matching dynamics in social networks. Inf. Comput. 222, 20\u201335 (2013)","journal-title":"Inf. Comput."},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-642-39212-2_54","volume-title":"Automata, Languages, and Programming","author":"M Hoefer","year":"2013","unstructured":"Hoefer, M., Wagner, L.: Locally stable marriage with strict preferences. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 620\u2013631. Springer, Heidelberg (2013)"},{"key":"40_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-319-13129-0_12","volume-title":"Web and Internet Economics","author":"M Hoefer","year":"2014","unstructured":"Hoefer, M., Wagner, L.: Matching dynamics with constraints. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 161\u2013174. Springer, Heidelberg (2014)"},{"issue":"1","key":"40_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/110852838","volume":"27","author":"C Huang","year":"2013","unstructured":"Huang, C., Kavitha, T.: Near-popular matchings in the roommates problem. SIAM J. Disc. Math. 27(1), 43\u201362 (2013)","journal-title":"SIAM J. Disc. Math."},{"key":"40_CR15","unstructured":"Knuth, D.: Marriages stables et leurs relations avec d\u2019autres problemes combinatoires. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al (1976)"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences. World Scientific (2013)","DOI":"10.1142\/8591"},{"key":"40_CR17","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":"RM 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. 4957, pp. 593\u2013604. Springer, Heidelberg (2008)"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Onak, K., Rubinfeld, R.: Maintaining a large matching and a small vertex cover. In: Proc. 42nd Symp. Theory of Computing (STOC), pp. 457\u2013464 (2010)","DOI":"10.1145\/1806689.1806753"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Roth, A., Sotomayor, M.O.: Two-sided Matching: A study in game-theoretic modeling and analysis. Cambridge University Press (1990)","DOI":"10.1017\/CCOL052139015X"},{"issue":"6","key":"40_CR20","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.2307\/2938326","volume":"58","author":"A Roth","year":"1990","unstructured":"Roth, A., Vate, J.V.: Random paths to stability in two-sided matching. Econometrica 58(6), 1475\u20131480 (1990)","journal-title":"Econometrica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:03:20Z","timestamp":1748459000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}