Preference swaps for the stable matching problem

DOI10.1016/j.tcs.2022.11.003OpenAlexW4226375230MaRDI QIDQ2699977

Eduard Eiben, Gregory Gutin, Philip R. Neary, Magnus Wahlström, Clément Rambaud, Anders Yeo

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.15361

zbMATH Keywords

stable matchingparameterized complexityswapssubmodular minimization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Kernels in perfect line-graphs
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Graphs and Marriages
• Of Stable Marriages and Graphs, and Strategy and Polytopes
• Complexity of the Steiner Network Problem with Respect to the Number of Terminals
• Bribery and Control in Stable Marriage
• Parameterized Algorithms
• Stable marriage assignment for unequal sets
• College Admissions and the Stability of Marriage

This page was built for publication: Preference swaps for the stable matching problem