{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:07:54Z","timestamp":1760710074552,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T00:00:00Z","timestamp":1575244800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T00:00:00Z","timestamp":1575244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71520107003"],"award-info":[{"award-number":["71520107003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The Shanghai Science Committee of China","award":["17495810503"],"award-info":[{"award-number":["17495810503"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10878-019-00501-2","type":"journal-article","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T10:02:35Z","timestamp":1576490555000},"page":"928-936","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Three-sided matching problem with mixed preferences"],"prefix":"10.1007","volume":"42","author":[{"given":"Feng","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7945-5248","authenticated-orcid":false,"given":"Liwei","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,2]]},"reference":[{"issue":"1","key":"501_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.geb.2011.06.004","volume":"74","author":"MO Afacan","year":"2012","unstructured":"Afacan MO (2012) Group robust stability in matching markets. Games Econ Behav 74(1):394\u2013398","journal-title":"Games Econ Behav"},{"issue":"3","key":"501_CR2","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1007\/s00453-016-0197-9","volume":"78","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich E, Bhardwaj O, Hoefer M (2017) Stable matching with network externalities. Algorithmica 78(3):1067\u20131106","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"501_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","volume":"101","author":"M Baiou","year":"2000","unstructured":"Baiou M, Balinski M (2000) Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Appl Math 101(1\u20133):1\u201312","journal-title":"Discrete Appl Math"},{"issue":"3","key":"501_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.tcs.2007.02.050","volume":"379","author":"V Bansal","year":"2007","unstructured":"Bansal V, Agrawal A, Malhotra VS (2007) Polynomial time algorithm for an optimal stable assignment with multiple partners. Theor Comput Sci 379(3):317\u2013328","journal-title":"Theor Comput Sci"},{"issue":"1","key":"501_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00453-009-9315-2","volume":"58","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3 P, McDermid E (2010) Three-sided stable matchings with cyclic preferences. Algorithmica 58(1):5\u201318","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"501_CR6","first-page":"1","volume":"289","author":"E Boros","year":"2004","unstructured":"Boros E, Gurvich V, Jaslar S, Krasner D (2004) Stable matchings in three-sided systems with cyclic preferences. Discrete Math 289(1\u20133):1\u201310","journal-title":"Discrete Math"},{"issue":"1","key":"501_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"K Eriksson","year":"2006","unstructured":"Eriksson K, Sj\u00f6strand J, Strimling P (2006) Three-dimensional stable matching with cyclic preferences. Math Soc Sci 52(1):77\u201387","journal-title":"Math Soc Sci"},{"issue":"1","key":"501_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9\u201315","journal-title":"Am Math Mon"},{"key":"501_CR9","doi-asserted-by":"crossref","unstructured":"Huang CC (2007) Two\u2019s company, three\u2019s a crowd: stable family and threesome roommates problems. In: European symposium on algorithms. Springer, Berlin, pp 558\u2013569","DOI":"10.1007\/978-3-540-75520-3_50"},{"issue":"1","key":"501_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00453-009-9356-6","volume":"58","author":"CC Huang","year":"2010","unstructured":"Huang CC (2010) Circular stable matching and 3-way kidney transplant. Algorithmica 58(1):137\u2013150","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"501_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10107-015-0923-0","volume":"154","author":"CC Huang","year":"2015","unstructured":"Huang CC, Kavitha T (2015) Improved approximation algorithms for two variants of the stable marriage problem with ties. Math Program 154(1\u20132):353\u2013380","journal-title":"Math Program"},{"issue":"1\u20133","key":"501_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0166-218X(01)00322-5","volume":"122","author":"DF Manlove","year":"2002","unstructured":"Manlove DF (2002) The structure of stable marriage with indifference. Discrete Appl Math 122(1\u20133):167\u2013181","journal-title":"Discrete Appl Math"},{"issue":"1","key":"501_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10601-016-9249-7","volume":"22","author":"DF Manlove","year":"2017","unstructured":"Manlove DF, McBride I, Trimble J (2017) \u201cAlmost-stable\u201d matchings in the hospitals\/residents problem with couples. Constraints 22(1):50\u201372","journal-title":"Constraints"},{"issue":"3","key":"501_CR14","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00453-012-9672-0","volume":"68","author":"E McDermid","year":"2014","unstructured":"McDermid E, Irving RW (2014) Sex-equal stable matchings: complexity and exact algorithms. Algorithmica 68(3):545\u2013570","journal-title":"Algorithmica"},{"issue":"3","key":"501_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"EJ McDermid","year":"2010","unstructured":"McDermid EJ, Manlove DF (2010) Keeping partners together: algorithmic results for the hospitals\/residents problem with couples. J Comb Optim 19(3):279\u2013303","journal-title":"J Comb Optim"},{"issue":"2","key":"501_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C Ng","year":"1991","unstructured":"Ng C, Hirschberg DS (1991) Three-dimensional stabl matching problems. SIAM J Discrete Math 4(2):245\u2013252","journal-title":"SIAM J Discrete Math"},{"issue":"3","key":"501_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1010311325241","volume":"50","author":"A Romero-Medina","year":"2001","unstructured":"Romero-Medina A (2001) \u2018Sex-equal\u2019 stable matchings. Theor Decis 50(3):197\u2013212","journal-title":"Theor Decis"},{"issue":"2","key":"501_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0899-8256(89)90018-3","volume":"1","author":"AE Roth","year":"1989","unstructured":"Roth AE (1989) Two-sided matching with incomplete information about others\u2019 preferences. Games Econ Behav 1(2):191\u2013209","journal-title":"Games Econ Behav"},{"issue":"1","key":"501_CR19","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s10878-017-0231-0","volume":"37","author":"F Zhang","year":"2019","unstructured":"Zhang F, Li J, Fan J, Shen H, Shen J, Yu H (2019) Three-dimensional stable matching with hybrid preferences. J Comb Optim 37(1):330\u2013336","journal-title":"J Comb Optim"},{"issue":"1","key":"501_CR20","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/s10878-017-0224-z","volume":"37","author":"L Zhong","year":"2019","unstructured":"Zhong L, Bai Y (2019) Three-sided stable matching problem with two of them as cooperative partners. J Comb Optim 37(1):286\u2013292","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00501-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00501-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00501-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T07:23:43Z","timestamp":1637652223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00501-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,2]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00501-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,12,2]]},"assertion":[{"value":"2 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}