{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:06:01Z","timestamp":1757621161597,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502172"},{"type":"electronic","value":"9789819502189"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0218-9_20","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:29Z","timestamp":1754168969000},"page":"268-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pareto Optimal Matching with\u00a0Multilayer Preferences: How Hard Can It Be?"],"prefix":"10.1007","author":[{"given":"Yinghui","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aizhong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1257\/000282805774670167","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E.: The New York city high school match. Am. Econ. Rev. 95(2), 364\u2013367 (2005)","journal-title":"Am. Econ. Rev."},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1257\/000282805774669637","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E., S\u00f6nmez, T.: The Boston public school match. Am. Econ. Rev. 95(2), 368\u2013371 (2005)","journal-title":"Am. Econ. Rev."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto optimality in house allocation problems. In: Proceedings of ISAAC-2015, pp. 3\u201315 (2004)","DOI":"10.1007\/978-3-540-30551-4_3"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Gamarnik, D., Rees, M.A., Roth, A.E.: The need for (long) chains in kidney exchange. Technical report, National Bureau of Economic Research (2012)","DOI":"10.3386\/w18202"},{"key":"20_CR5","unstructured":"Aziz, H., Chen, J., Gaspers, S., Sun, Z.: Stability and pareto optimality in refugee allocation matchings. In: Proceedings of AAMAS-2018, pp. 964\u2013972 (2018)"},{"key":"20_CR6","unstructured":"Aziz, H., Gaspers, S., Sun, Z., Walsh, T.: From matching with diversity constraints to matching with regional quotas. In: Proceedings of AAMAS-2019, pp. 377\u2013385 (2019)"},{"key":"20_CR7","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":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ejor.2020.03.018","volume":"291","author":"P Bir\u00f3","year":"2021","unstructured":"Bir\u00f3, P., Gudmundsson, J.: Complexity of finding pareto-efficient allocations of highest welfare. Eur. J. Oper. Res. 291(2), 614\u2013628 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"20_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277\u2013305 (2014)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ejor.2018.04.022","volume":"271","author":"M Bottero","year":"2018","unstructured":"Bottero, M., Ferretti, V., Figueira, J.R., Greco, S., Roy, B.: On the choquet multiple criteria preference aggregation model: theoretical and practical insights from a real-world application. Eur. J. Oper. Res. 271(1), 120\u2013140 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Heeger, K., Knop, D., Niedermeier, R.: Multidimensional stable roommates with master list. In: Proceedings of WINE-2020, vol. 12495, pp. 59\u201373 (2020)","DOI":"10.1007\/978-3-030-64946-3_5"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.disopt.2014.09.002","volume":"14","author":"K Cechl\u00e1rov\u00e1","year":"2014","unstructured":"Cechl\u00e1rov\u00e1, K., Eirinakis, P., Fleiner, T., Magos, D., Mourtos, I., Potpinkov\u00e1, E.: Pareto optimality in many-to-many matching problems. Discret. Optim. 14, 160\u2013169 (2014)","journal-title":"Discret. Optim."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.mathsocsci.2017.03.007","volume":"88","author":"K Cechl\u00e1rov\u00e1","year":"2017","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: Pareto optimal matchings with lower quotas. Math. Soc. Sci. 88, 3\u201310 (2017)","journal-title":"Math. Soc. Sci."},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Chen, J., Niedermeier, R., Skowron, P.: Stable marriage with multi-modal preferences. In: Proceedings of EC-2018, pp. 269\u2013286 (2018)","DOI":"10.1145\/3219166.3219168"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Cs\u00e1ji, G.: Popular and dominant matchings with uncertain and multimodal preferences. In: Proceedings of IJCAI-2024, pp. 2740\u20132747 (2024)","DOI":"10.24963\/ijcai.2024\/303"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer (2012)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-016-9687-z","volume":"59","author":"L Farczadi","year":"2016","unstructured":"Farczadi, L., Georgiou, K., K\u00f6nemann, J.: Stable marriage with general preferences. Theory Comput. Syst. 59(4), 683\u2013699 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"15","key":"20_CR21","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","volume":"156","author":"RW Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discret. Appl. Math. 156(15), 2959\u20132977 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"20_CR22","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1080\/03081079.2020.1786822","volume":"49","author":"L Jin","year":"2020","unstructured":"Jin, L., Mesiar, R., Yager, R.R.: Parameterized preference aggregation operators with improved adjustability. Int. J. Gen. Syst. 49(8), 843\u2013855 (2020)","journal-title":"Int. J. Gen. Syst."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Kamiyama, N.: Stable matchings with ties, master preference lists, and matroid constraints. In: Proceedings of SAGT-2015, vol.\u00a09347, pp. 3\u201314 (2015)","DOI":"10.1007\/978-3-662-48433-3_1"},{"key":"20_CR24","unstructured":"Kamiyama, N.: Many-to-many stable matchings with ties, master preference lists, and matroid constraints. In: Proceedings of AAMAS-2019, pp. 583\u2013591 (2019)"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.artint.2018.12.010","volume":"272","author":"T Lukasiewicz","year":"2019","unstructured":"Lukasiewicz, T., Malizia, E.: Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting. Artif. Intell. 272, 101\u2013142 (2019)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"20_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Manlove, D.F., O\u2019Malley, G.: Paired and altruistic kidney donation in the UK: algorithms and experimentation. ACM J. Exp. Algorithmics 19(1) (2014)","DOI":"10.1145\/2670129"},{"issue":"2","key":"20_CR28","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/s10878-019-00402-4","volume":"38","author":"S Miyazaki","year":"2019","unstructured":"Miyazaki, S., Okamoto, K.: Jointly stable matchings. J. Comb. Optim. 38(2), 646\u2013665 (2019)","journal-title":"J. Comb. Optim."},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"2","key":"20_CR30","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Pairwise kidney exchange. J. Econ. Theory 125(2), 151\u2013188 (2005)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"20_CR31","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"AE Roth","year":"2007","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences. Am. Econ. Rev. 97(3), 828\u2013851 (2007)","journal-title":"Am. Econ. Rev."},{"key":"20_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114445","volume":"994","author":"I Schlotter","year":"2024","unstructured":"Schlotter, I.: Recognizing when a preference system is close to admitting a master list. Theor. Comput. Sci. 994, 114445 (2024)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Steindl, B., Zehavi, M.: Parameterized analysis of assignment under multiple preferences. In: Proceedings of EUMAS-2021, pp. 160\u2013177 (2021)","DOI":"10.1007\/978-3-030-82254-5_10"},{"issue":"1","key":"20_CR34","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10458-022-09546-w","volume":"36","author":"B Steindl","year":"2022","unstructured":"Steindl, B., Zehavi, M.: Verification of multi-layered assignment problems. Auton. Agents Multi Agent Syst. 36(1), 15 (2022)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"20_CR35","unstructured":"Wen, Y., Zhou, A., Guo, J.: Position-based matching with multi-modal preferences. In: Proceedings of AAMAS-2022, pp. 1373\u20131381 (2022)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0218-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:40:26Z","timestamp":1757335226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of\u00a0Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}