DROPS

Document

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

Authors: Jiehua Chen, Christine Cheng, David Manlove, Ildikó Schlotter, and Manuel Sorge

Published in: Dagstuhl Reports, Volume 15, Issue 8 (2026)

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

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)

Copy BibTex To Clipboard

@Article{chen_et_al:DagRep.15.8.29,
  author =	{Chen, Jiehua and Cheng, Christine and Manlove, David and Schlotter, Ildik\'{o} and Sorge, Manuel},
  title =	{{Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342)}},
  pages =	{29--45},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2026},
  volume =	{15},
  number =	{8},
  editor =	{Chen, Jiehua and Cheng, Christine and Manlove, David and Schlotter, Ildik\'{o} and Sorge, Manuel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.8.29},
  URN =		{urn:nbn:de:0030-drops-257744},
  doi =		{10.4230/DagRep.15.8.29},
  annote =	{Keywords: Algorithmic design and complexity analysis, Matching markets, Matching theory, Parameterizec complexity analysis}
}

Search Results

Documents authored by Cheng, Christine

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

Abstract

Cite as

Thanks for your feedback!

Could not send message