Stable matching with approval preferences under partial information

DOI10.1007/S10878-026-01392-WMaRDI QIDQ6845805zbMATH OpenFDO

Authors Yaqin Chu, Jun-Jie Luo, Tianyang Zheng

Publication date 12 March 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01392-W

zbMATH Keywords

approval preferenceblocking pairscomputational complexityexact matchingnonlinear matchingpartial informationstable matching

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• College Admissions and the Stability of Marriage
• Exact matching: algorithms and related problems
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• Nonlinear bipartite matching
• Random Matching Under Dichotomous Preferences
• Robust and approximately stable marriages under partial information
• Stable marriage and indifference
• Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
• Stable matching with uncertain linear preferences
• Stable matching with uncertain pairwise preferences
• The complexity of restricted spanning tree problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Stable matching with approval preferences under partial information

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