2026-07-22T12:15:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25774 2026-06-23T13:29:40Z ddc:004 open_access

Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342) Chen, Jiehua Cheng, Christine Manlove, David Schlotter, Ildikó Sorge, Manuel Algorithmic design and complexity analysis Matching markets Matching theory Parameterizec complexity analysis This report documents the program and the outcomes of Dagstuhl Seminar 25342 "Frontiers of Parameterized Algorithmics of Matching under Preferences", held from August 17-22, 2025. The seminar brought together researchers from the Matching Under Preferences (MATCH-UP) and Parameterized Complexity Theory (PCT) communities to systematically apply parameterized techniques to computationally hard matching problems. The program included tutorials on parameterized algorithmics, surveys on MATCH-UP complexity and structure of stable matchings, contributed talks, and intensive working group sessions that explored fundamental open problems. This seminar represents the first focused effort to comprehensively map the parameterized complexity landscape of matching markets, establishing frameworks for ongoing collaboration between these communities. The report presents abstracts of talks, tutorials, working groups, and open problems in alphabetical order by speaker. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jiehua Chen and Christine Cheng and David Manlove and Ildikó Schlotter and Manuel Sorge 2026 Is Part Of Dagstuhl Reports, Volume 15, Issue 8 (2026) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.15.8.29 urn:nbn:de:0030-drops-257744 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.8.29 eng https://creativecommons.org/licenses/by/4.0/legalcode