Robust and approximately stable marriages under partial information
From MaRDI portal
Publication:2190410
DOI10.1007/978-3-030-04612-5_23zbMath1443.91214arXiv1804.09156OpenAlexW2962846511MaRDI QIDQ2190410
Publication date: 18 June 2020
Full work available at URL: https://arxiv.org/abs/1804.09156
Related Items (1)
Cites Work
- Unnamed Item
- A maximum stable matching for the roommates problem
- Size versus stability in the marriage problem
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Stable marriage and indifference
- Hard variants of stable marriage.
- Stable Matching with Uncertain Linear Preferences
- Mechanism design with approximate valuations
- An efficient algorithm for the “stable roommates” problem
- Reducibility among Combinatorial Problems
- Algorithmics of Matching Under Preferences
- Approximation and Online Algorithms
- Encyclopedia of Algorithms
- College Admissions and the Stability of Marriage
This page was built for publication: Robust and approximately stable marriages under partial information