{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:40:10Z","timestamp":1751193610025,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819683116","type":"print"},{"value":"9789819683123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8312-3_22","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:15:09Z","timestamp":1751192109000},"page":"293-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Blocking Agents for\u00a0Stable Matching with\u00a0Partial Approval Information"],"prefix":"10.1007","author":[{"given":"Yitian","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8892-8863","authenticated-orcid":false,"given":"Junjie","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"issue":"5","key":"22_CR1","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.: Stable matching with uncertain linear preferences. Algorithmica 82(5), 1410\u20131433 (2020)","journal-title":"Algorithmica"},{"key":"22_CR2","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.: Stable matching with multilayer approval preferences: approvals can be harder than strict preferences. Games Econ. Behav. 142, 508\u2013526 (2023)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"22_CR3","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.: Nonlinear bipartite matching. Discret. Optim. 5(1), 53\u201365 (2008)","journal-title":"Discret. Optim."},{"issue":"16\u201318","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.tcs.2010.02.003","volume":"411","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theoret. Comput. Sci. 411(16\u201318), 1828\u20131841 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR5","unstructured":"Boehmer, N., Brill, M., Schmidt-Kraepelin, U.: Proportional representation in matching markets: selecting multiple matchings under dichotomous preferences. In: AAMAS 2022, pp. 136\u2013144 (2022)"},{"issue":"1","key":"22_CR6","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.: Random matching under dichotomous preferences. Econometrica 72(1), 257\u2013279 (2004)","journal-title":"Econometrica"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Chu, Y., Luo, J., Zheng, T.: Stable matching with approval preferences under partial information. In: AAIM 2024, pp. 64\u201375 (2024)","DOI":"10.1007\/978-981-97-7801-0_6"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/s10601-023-09346-3","volume":"28","author":"\u00c1 Cseh","year":"2023","unstructured":"Cseh, \u00c1., Escamocher, G., Quesada, L.: Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints 28(2), 138\u2013165 (2023)","journal-title":"Constraints"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00182-007-0081-6","volume":"36","author":"K Eriksson","year":"2008","unstructured":"Eriksson, K., H\u00e4ggstr\u00f6m, O.: Instability of matchings in decentralized markets with various preference structures. Internat. J. Game Theory 36, 409\u2013420 (2008)","journal-title":"Internat. J. Game Theory"},{"issue":"5","key":"22_CR10","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, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 120(5), 386\u2013391 (2013)","journal-title":"Am. Math. Mon."},{"key":"22_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"22_CR12","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press (1989)"},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discret. Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discret. Appl. Math."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Knittel, M., Dooley, S., Dickerson, J.P.: The dichotomous affiliate stable matching problem: approval-based matching with applicant-employer relations. In: IJCAI 2022, pp. 356\u2013362 (2022)","DOI":"10.24963\/ijcai.2022\/51"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences, vol.\u00a02. World Scientific (2013)","DOI":"10.1142\/8591"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2020.08.017","volume":"844","author":"K Meeks","year":"2020","unstructured":"Meeks, K., Rastegari, B.: Solving hard stable matching problems involving groups of similar agents. Theoret. Comput. Sci. 844, 171\u2013194 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Menon, V., Larson, K.: Robust and approximately stable marriages under partial information. In: WINE 2018, pp. 341\u2013355 (2018)","DOI":"10.1007\/978-3-030-04612-5_23"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1086\/262074","volume":"105","author":"AE Roth","year":"1997","unstructured":"Roth, A.E., Xing, X.: Turnaround time and bottlenecks in market clearing: decentralized matching in the market for clinical psychologists. J. Polit. Econ. 105(2), 284\u2013329 (1997)","journal-title":"J. Polit. Econ."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8312-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:15:12Z","timestamp":1751192112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8312-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819683116","9789819683123"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8312-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs-faw.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}