{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:44:44Z","timestamp":1775947484440,"version":"3.50.1"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115901","type":"journal-article","created":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:35:15Z","timestamp":1774078515000},"page":"115901","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Pareto optimal matching with multilayer preferences: How hard can it be?"],"prefix":"10.1016","volume":"1073","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1748-0779","authenticated-orcid":false,"given":"Yinghui","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9222-4610","authenticated-orcid":false,"given":"Xin","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2137-205X","authenticated-orcid":false,"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2010-8046","authenticated-orcid":false,"given":"Aizhong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2026.115901_bib0001","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1257\/000282805774670167","article-title":"The New York city high school match","volume":"95","author":"Abdulkadiro\u011flu","year":"2005","journal-title":"Am. Econ. Rev."},{"issue":"2","key":"10.1016\/j.tcs.2026.115901_bib0002","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1257\/000282805774669637","article-title":"The Boston public school match","volume":"95","author":"Abdulkadiro\u011flu","year":"2005","journal-title":"Am. Econ. Rev."},{"issue":"1","key":"10.1016\/j.tcs.2026.115901_bib0003","first-page":"1","article-title":"Paired and altruistic kidney donation in the UK: algorithms and experimentation","volume":"19","author":"Manlove","year":"2014","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"2","key":"10.1016\/j.tcs.2026.115901_bib0004","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","article-title":"Pairwise kidney exchange","volume":"125","author":"Roth","year":"2005","journal-title":"J. Econ. Theory"},{"issue":"3","key":"10.1016\/j.tcs.2026.115901_bib0005","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1257\/aer.97.3.828","article-title":"Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences","volume":"97","author":"Roth","year":"2007","journal-title":"Am. Econ. Rev."},{"key":"10.1016\/j.tcs.2026.115901_bib0006","series-title":"Proc. of AAMAS-2018","first-page":"964","article-title":"Stability and pareto optimality in refugee allocation matchings","author":"Aziz","year":"2018"},{"key":"10.1016\/j.tcs.2026.115901_bib0007","series-title":"Proc. of AAMAS-2019","first-page":"377","article-title":"From matching with diversity constraints to matching with regional quotas","author":"Aziz","year":"2019"},{"key":"10.1016\/j.tcs.2026.115901_bib0008","series-title":"Proc. of ISAAC-2015","first-page":"3","article-title":"Pareto optimality in house allocation problems","author":"Abraham","year":"2004"},{"issue":"2","key":"10.1016\/j.tcs.2026.115901_bib0009","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.ejor.2020.03.018","article-title":"Complexity of finding Pareto-efficient allocations of highest welfare","volume":"291","author":"Bir\u00f3","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.tcs.2026.115901_bib0010","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.disopt.2014.09.002","article-title":"Pareto optimality in many-to-many matching problems","volume":"14","author":"Cechl\u00e1rov\u00e1","year":"2014","journal-title":"Discret. Optim."},{"key":"10.1016\/j.tcs.2026.115901_bib0011","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.mathsocsci.2017.03.007","article-title":"Pareto optimal matchings with lower quotas","volume":"88","author":"Cechl\u00e1rov\u00e1","year":"2017","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115901_bib0012","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ejor.2018.04.022","article-title":"On the Choquet multiple criteria preference aggregation model: theoretical and practical insights from a real-world application","volume":"271","author":"Bottero","year":"2018","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"10.1016\/j.tcs.2026.115901_bib0013","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1080\/03081079.2020.1786822","article-title":"Parameterized preference aggregation operators with improved adjustability","volume":"49","author":"Jin","year":"2020","journal-title":"Int. J. Gen. Syst."},{"key":"10.1016\/j.tcs.2026.115901_bib0014","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.artint.2018.12.010","article-title":"Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting","volume":"272","author":"Lukasiewicz","year":"2019","journal-title":"Artif. Intell."},{"issue":"4","key":"10.1016\/j.tcs.2026.115901_bib0015","doi-asserted-by":"crossref","first-page":"2150026:1","DOI":"10.1142\/S1793962321500264","article-title":"Aggregation of preferences in attitude scales","volume":"12","author":"Smerchinskaya","year":"2021","journal-title":"Int. J. Model. Simul. Sci. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2026.115901_bib0016","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s00224-016-9687-z","article-title":"Stable marriage with general preferences","volume":"59","author":"Farczadi","year":"2016","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.115901_bib0017","series-title":"Technical Report","article-title":"The Need for (long) Chains in Kidney Exchange","author":"Ashlagi","year":"2012"},{"issue":"1","key":"10.1016\/j.tcs.2026.115901_bib0018","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10458-022-09546-w","article-title":"Verification of multi-layered assignment problems","volume":"36","author":"Steindl","year":"2022","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"10.1016\/j.tcs.2026.115901_bib0019","series-title":"Proc. of EUMAS-2021","first-page":"160","article-title":"Parameterized analysis of assignment under multiple preferences","author":"Steindl","year":"2021"},{"issue":"1-2","key":"10.1016\/j.tcs.2026.115901_bib0020","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","article-title":"Hard variants of stable marriage","volume":"276","author":"Manlove","year":"2002","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115901_bib0021","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.tcs.2026.115901_bib0022","series-title":"Proc. of AAMAS-2022","first-page":"1373","article-title":"Position-based matching with multi-modal preferences","author":"Wen","year":"2022"},{"key":"10.1016\/j.tcs.2026.115901_bib0023","series-title":"Proc. of EC-2018","first-page":"269","article-title":"Stable marriage with multi-modal preferences","author":"Chen","year":"2018"},{"issue":"2","key":"10.1016\/j.tcs.2026.115901_bib0024","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1007\/s10878-019-00402-4","article-title":"Jointly stable matchings","volume":"38","author":"Miyazaki","year":"2019","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.115901_bib0025","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1016\/j.geb.2023.09.001","article-title":"Stable matching with multilayer approval preferences: approvals can be harder than strict preferences","volume":"142","author":"Bentert","year":"2023","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.tcs.2026.115901_bib0026","series-title":"Proc. of IJCAI-2024","first-page":"2740","article-title":"Popular and dominant matchings with uncertain and multimodal preferences","author":"Cs\u00e1ji","year":"2024"},{"key":"10.1016\/j.tcs.2026.115901_bib0027","series-title":"Proc. of WINE-2020","first-page":"59","article-title":"Multidimensional stable roommates with master list","volume":"12495","author":"Bredereck","year":"2020"},{"issue":"15","key":"10.1016\/j.tcs.2026.115901_bib0028","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","article-title":"The stable marriage problem with master preference lists","volume":"156","author":"Irving","year":"2008","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115901_bib0029","series-title":"Proc. of SAGT-2015","first-page":"3","article-title":"Stable matchings with ties, master preference lists, and matroid constraints","volume":"9347","author":"Kamiyama","year":"2015"},{"key":"10.1016\/j.tcs.2026.115901_bib0030","series-title":"Proc. of AAMAS-2019","first-page":"583","article-title":"Many-to-many stable matchings with ties, master preference lists, and matroid constraints","author":"Kamiyama","year":"2019"},{"key":"10.1016\/j.tcs.2026.115901_bib0031","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114445","article-title":"Recognizing when a preference system is close to admitting a master list","volume":"994","author":"Schlotter","year":"2024","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115901_bib0032","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.tcs.2026.115901_bib0033","series-title":"Parameterized Complexity","author":"Downey","year":"2012"},{"key":"10.1016\/j.tcs.2026.115901_bib0034","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"issue":"8","key":"10.1016\/j.tcs.2026.115901_bib0035","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","article-title":"On problems without polynomial kernels","volume":"75","author":"Bodlaender","year":"2009","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115901_bib0036","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/120880240","article-title":"Kernelization lower bounds by cross-composition","volume":"28","author":"Bodlaender","year":"2014","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"10.1016\/j.tcs.2026.115901_bib0037","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","article-title":"The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two","volume":"8","author":"Plesn\u00edk","year":"1979","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10.1016\/j.tcs.2026.115901_bib0038","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/16M1104834","article-title":"Slightly superexponential parameterized problems","volume":"47","author":"Lokshtanov","year":"2018","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600160X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600160X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:03:40Z","timestamp":1775945020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600160X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":38,"alternative-id":["S030439752600160X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115901","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pareto optimal matching with multilayer preferences: How hard can it be?","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115901","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115901"}}