Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342)

Chen, Jiehua; Cheng, Christine; Manlove, David; Schlotter, Ildikó; Sorge, Manuel

doi:10.4230/DagRep.15.8.29

Document

Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342)

Authors Jiehua Chen, Christine Cheng, David Manlove, Ildikó Schlotter, Manuel Sorge and all authors of the abstracts in this report

Part of: Issue: Dagstuhl Reports, Volume 15, Issue 8
Part of: Volume: Dagstuhl Reports, Volume 15
Part of: Journal: Dagstuhl Reports (DagRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2026-04-30

PDF

File

PDF

DagRep.15.8.29.pdf

Filesize: 2.26 MB
17 pages

Document Identifiers

DOI: 10.4230/DagRep.15.8.29
URN: urn:nbn:de:0030-drops-257744

Subject Classification

ACM Subject Classification

Theory of computation → Algorithmic game theory and mechanism design
Theory of computation → Computational complexity and cryptography
Theory of computation → Design and analysis of algorithms
Theory of computation → Parameterized complexity and exact algorithms
Theory of computation

Keywords

Algorithmic design and complexity analysis
Matching markets
Matching theory
Parameterizec complexity analysis

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

Document

0

Metadata

Abstract

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.

Cite As Get BibTex

Jiehua Chen, Christine Cheng, David Manlove, Ildikó Schlotter, and Manuel Sorge. Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342). In Dagstuhl Reports, Volume 15, Issue 8, pp. 29-45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/DagRep.15.8.29

Author Details

Jiehua Chen

TU Wien, AT

Christine Cheng

University of Wisconsin - Milwaukee, US

David Manlove

University of Glasgow, GB

Ildikó Schlotter

ELTE KRTK - Budapest, HU

Manuel Sorge

TU Wien, AT

and all authors of the abstracts in this report

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail