Minimizing blocking agents for stable matching with partial approval information

DOI10.1007/978-981-96-8312-3_22MaRDI QIDQ6897272zbMATH OpenFDO

Authors Yi-Tian Gao, Jiaxue Li, Jun-Jie Luo, Yiheng Zhang

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-8312-3_22

zbMATH Keywords

approval preferenceblocking agentscomputational complexitynonlinear matchingpartial informationstable matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• College Admissions and the Stability of Marriage
• Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Instability of matchings in decentralized markets with various preference structures
• Nonlinear bipartite matching
• Random Matching Under Dichotomous Preferences
• Robust and approximately stable marriages under partial information
• Size versus stability in the marriage problem
• Solving hard stable matching problems involving groups of similar agents
• Stable marriage and indifference
• Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
• Stable matching with uncertain linear preferences

This page was built for publication: Minimizing blocking agents for stable matching with partial approval information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897272)