A simply exponential upper bound on the maximum number of stable matchings
From MaRDI portal
Publication:5230350
DOI10.1145/3188745.3188848zbMath1431.91255arXiv1711.01032OpenAlexW2962683253MaRDI QIDQ5230350
Anna R. Karlin, Robbie Weber, Shayan Oveis Gharan
Publication date: 22 August 2019
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.01032
Related Items (6)
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings ⋮ Disjoint stable matchings in linear time ⋮ The graphs of stably matchable pairs ⋮ Review of the theory of stable matchings and contract systems ⋮ Jointly stable matchings ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective
This page was built for publication: A simply exponential upper bound on the maximum number of stable matchings
