A number of stable matchings in models of the Gale-Shapley type
From MaRDI portal
Publication:2446884
DOI10.1016/j.dam.2013.06.031zbMath1285.91101OpenAlexW2041575920MaRDI QIDQ2446884
Zbigniew Świtalski, Ewa Drgas-Burchardt
Publication date: 23 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.031
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Related Items (3)
An extendable stable matching algorithm of a kind of bipartite graph ⋮ Review of the theory of stable matchings and contract systems ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective
Cites Work
- Unnamed Item
- The complexity of approximately counting stable roommate assignments
- Concerning the maximum number of stable matchings in the stable marriage problem
- How do I marry thee? Let me count the ways
- THE TWO-SIDED MATCHING PROBLEM: ORIGIN, DEVELOPMENT AND CURRENT ISSUES
- The Complexity of Counting Stable Marriages
- College Admissions and the Stability of Marriage
This page was built for publication: A number of stable matchings in models of the Gale-Shapley type