{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T08:15:54Z","timestamp":1777623354124,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,21]],"date-time":"2010-01-21T00:00:00Z","timestamp":1264032000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-009-9287-9","type":"journal-article","created":{"date-parts":[[2010,1,20]],"date-time":"2010-01-20T16:00:27Z","timestamp":1264003227000},"page":"339-358","source":"Crossref","is-referenced-by-count":23,"title":["Popular matchings: structure and algorithms"],"prefix":"10.1007","volume":"22","author":[{"given":"Eric","family":"McDermid","sequence":"first","affiliation":[]},{"given":"Robert W.","family":"Irving","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,21]]},"reference":[{"key":"9287_CR1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/11785293_9","volume-title":"Proceedings of SWAT 2006, the 10th Scandinavian workshop on algorithm theory","author":"DJ Abraham","year":"2006","unstructured":"Abraham DJ, Kavitha T (2006) Dynamic matching markets and voting paths. In: Proceedings of SWAT 2006, the 10th Scandinavian workshop on algorithm theory. Lecture notes in computer science, vol\u00a04059. Springer, Berlin, pp 65\u201376"},{"key":"9287_CR2","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"DJ Abraham","year":"2007","unstructured":"Abraham DJ, Irving RW, Kavitha T, Mehlhorn K (2007) Popular matchings. SIAM J Comput 37:1030\u20131045. Preliminary version in Proc of SODA 2005, the 16th ACM\/SIAM symposium on discrete algorithms, pp\u00a0424\u2013432, 2005","journal-title":"SIAM J Comput"},{"key":"9287_CR3","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P Gardenfors","year":"1975","unstructured":"Gardenfors P (1975) Match making: assignments based on bilateral preferences. Behav Sci 20:166\u2013173","journal-title":"Behav Sci"},{"key":"9287_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-540-69903-3_13","volume-title":"Proceedings of SWAT 2008, the 12th Scandinavian workshop on algorithm theory","author":"C-C Huang","year":"2008","unstructured":"Huang C-C, Kavitha T, Michail D, Nasre M (2008) Bounded unpopularity matchings. In: Proceedings of SWAT 2008, the 12th Scandinavian workshop on algorithm theory. Lecture notes in computer science, vol 5124. Springer, Berlin, pp 127\u2013137"},{"key":"9287_CR5","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"RW Irving","year":"2006","unstructured":"Irving RW, Kavitha T, Mehlhorn K, Michail D, Paluch K (2006) Rank-maximal matchings. ACM Trans Algorithms 2:602\u2013610. Preliminary version in Proc of SODA 2004, the 15th ACM\/SIAM symposium on discrete algorithms, pp\u00a068\u201375, 2004","journal-title":"ACM Trans Algorithms"},{"key":"9287_CR6","unstructured":"Kavitha T, Nasre M (2008) Optimal popular matchings. In: Proceedings of MATCH-UP: matching under preferences\u2014algorithms and complexity, satellite workshop of ICALP"},{"key":"9287_CR7","doi-asserted-by":"crossref","unstructured":"Mahdian M (2006) Random popular matchings. In: Proceedings of EC 2006: the 7th ACM conference on electronic commerce, pp 238\u2013242","DOI":"10.1145\/1134707.1134733"},{"key":"9287_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1007\/11841036_45","volume-title":"Proceedings of ESA 2006, the 14th annual European symposium on algorithms","author":"DF Manlove","year":"2006","unstructured":"Manlove DF, Sng CTS (2006) Popular matchings in the capacitated house allocation problem. In: Proceedings of ESA 2006, the 14th annual European symposium on algorithms. Lecture notes in computer science, vol 4168. Springer, Berlin, pp 492\u2013503"},{"key":"9287_CR9","doi-asserted-by":"crossref","unstructured":"McCutchen R (2008) The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Proc of the 8th Latin American symposium on theoretical informatics (LATIN\u201908), pp 593\u2013604","DOI":"10.1007\/978-3-540-78773-0_51"},{"key":"9287_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/11786986_62","volume-title":"Proceedings of ICALP 2006, the 33rd international colloquium on automata, languages and programming","author":"J Mestre","year":"2006","unstructured":"Mestre J (2006) Weighted popular matchings. In: Proceedings of ICALP 2006, the 33rd international colloquium on automata, languages and programming. Lecture notes in computer science, vol 4051. Springer, Berlin, pp 715\u2013726"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9287-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9287-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9287-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9287-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,21]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9287"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9287-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,21]]}}}