{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:48:21Z","timestamp":1774727301205,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005086","name":"Beijing Jiaotong University Research Program","doi-asserted-by":"publisher","award":["2023XKRC007"],"award-info":[{"award-number":["2023XKRC007"]}],"id":[{"id":"10.13039\/501100005086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301412"],"award-info":[{"award-number":["12301412"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10878-026-01392-w","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T07:49:24Z","timestamp":1770623364000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stable matching with approval preferences under partial information"],"prefix":"10.1007","volume":"51","author":[{"given":"Yaqin","family":"Chu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8892-8863","authenticated-orcid":false,"given":"Junjie","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Tianyang","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"key":"1392_CR1","unstructured":"URL http:\/\/lemon.cs.elte.hu\/egres\/open\/Exact_matching_in_red-blue_bipartite_graphs"},{"issue":"5","key":"1392_CR2","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1007\/s00453-019-00650-0","volume":"82","author":"H Aziz","year":"2020","unstructured":"Aziz H, Bir\u00f3 P, Gaspers S, de Haan R, Mattei N, Rastegari B (2020) Stable matching with uncertain linear preferences. Algorithmica 82(5):1410\u20131433","journal-title":"Algorithmica"},{"issue":"4","key":"1392_CR3","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/3417738","volume":"8","author":"H Aziz","year":"2020","unstructured":"Aziz H, Bogomolnaia A, Moulin H (2020) Fair mixing: The case of dichotomous preferences. ACM Trans Econ Comput 8(4):18:1-18:27","journal-title":"ACM Trans Econ Comput"},{"key":"1392_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.01.028","volume":"909","author":"H Aziz","year":"2022","unstructured":"Aziz H, Bir\u00f3 P, Fleiner T, Gaspers S, De Haan R, Mattei N, Rastegari B (2022) Stable matching with uncertain pairwise preferences. Theoret Comput Sci 909:1\u201311","journal-title":"Theoret Comput Sci"},{"key":"1392_CR5","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.geb.2023.09.001","volume":"142","author":"M Bentert","year":"2023","unstructured":"Bentert M, Boehmer N, Heeger K, Koana T (2023) Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ Behav 142:508\u2013526","journal-title":"Games Econ Behav"},{"issue":"1","key":"1392_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.disopt.2007.11.002","volume":"5","author":"Y Berstein","year":"2008","unstructured":"Berstein Y, Onn S (2008) Nonlinear bipartite matching. Discret Optim 5(1):53\u201365","journal-title":"Discret Optim"},{"key":"1392_CR7","unstructured":"Berstein Y, Lee J, Onn S, Weismantel R (2008) Nonlinear optimization for matroid intersection and extensions. IBM Research Report RC24610"},{"key":"1392_CR8","doi-asserted-by":"crossref","unstructured":"Boehmer N, Brill M, Schmidt-Kraepelin U (2023) Proportional representation in matching markets: selecting multiple matchings under dichotomous preferences. Social Choice and Welfare, pp. 1\u201342","DOI":"10.1007\/s00355-023-01453-7"},{"issue":"1","key":"1392_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A Bogomolnaia","year":"2004","unstructured":"Bogomolnaia A, Moulin H (2004) Random matching under dichotomous preferences. Econometrica 72(1):257\u2013279","journal-title":"Econometrica"},{"issue":"3","key":"1392_CR10","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3565558","volume":"10","author":"CT Cheng","year":"2022","unstructured":"Cheng CT, Rosenbaum W (2022) Stable matchings with restricted preferences: Structure and complexity. ACM Trans Econ Comput 10(3):13:1-13:45","journal-title":"ACM Trans Econ Comput"},{"key":"1392_CR11","unstructured":"Drummond J, Boutilier C (2013) Elicitation and approximately stable matching with partial preferences. In: IJCAI 2013, pp. 97\u2013105"},{"issue":"2","key":"1392_CR12","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19(2):248\u2013264","journal-title":"J ACM"},{"issue":"5","key":"1392_CR13","doi-asserted-by":"publisher","first-page":"386","DOI":"10.4169\/amer.math.monthly.120.05.386","volume":"120","author":"D Gale","year":"2013","unstructured":"Gale D, Shapley LS (2013) College admissions and the stability of marriage. Am Math Mon 120(5):386\u2013391","journal-title":"Am Math Mon"},{"key":"1392_CR14","volume-title":"The stable marriage problem: structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms. MIT press"},{"issue":"3","key":"1392_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving RW (1994) Stable marriage and indifference. Discret Appl Math 48(3):261\u2013272","journal-title":"Discret Appl Math"},{"key":"1392_CR16","first-page":"356","volume":"2022","author":"M Knittel","year":"2022","unstructured":"Knittel M, Dooley S, Dickerson JP (2022) The dichotomous affiliate stable matching problem: Approval-based matching with applicant-employer relations. IJCAI 2022:356\u2013362","journal-title":"IJCAI"},{"key":"1392_CR17","unstructured":"El Maalouly N (2023) Exact matching: Algorithms and related problems. In: STACS 2023, pp. 29:1\u201329:17"},{"key":"1392_CR18","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of matching under preferences","author":"D Manlove","year":"2013","unstructured":"Manlove D (2013) Algorithmics of matching under preferences, vol 2. World Scientific"},{"key":"1392_CR19","first-page":"341","volume":"2018","author":"V Menon","year":"2018","unstructured":"Menon V, Larson K (2018) Robust and approximately stable marriages under partial information. WINE 2018:341\u2013355","journal-title":"WINE"},{"issue":"2","key":"1392_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou CH, Yannakakis M (1982) The complexity of restricted spanning tree problems. J ACM 29(2):285\u2013309","journal-title":"J ACM"},{"key":"1392_CR21","doi-asserted-by":"crossref","unstructured":"Rastegari B, Condon A, Immorlica N, Leyton-Brown K (2013) Two-sided matching with partial information. In: EC 2013, pp. 733\u2013750","DOI":"10.1145\/2482540.2482607"},{"key":"1392_CR22","doi-asserted-by":"crossref","unstructured":"Rastegari B, Condon A, Immorlica N, Irving R, Leyton-Brown K (2014) Reasoning about optimal stable matchings under partial information. In: EC 2014, pp. 431\u2013448","DOI":"10.1145\/2600057.2602884"},{"key":"1392_CR23","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1609\/aaai.v33i01.33012181","volume":"2019","author":"N Talmon","year":"2019","unstructured":"Talmon N, Faliszewski P (2019) A framework for approval-based budgeting methods. AAAI 2019:2181\u20132188","journal-title":"AAAI"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01392-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01392-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01392-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:59:41Z","timestamp":1774724381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01392-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1392"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01392-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"14 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"16"}}