A number of stable matchings in models of the Gale-Shapley type

DOI10.1016/J.DAM.2013.06.031MaRDI QIDQ2446884zbMATH OpenOpenAlexFDO

Authors Ewa Drgas-Burchardt, Zbigniew Świtalski

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

zbMATH Keywords

Gale-Shapley modelstable matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Recommendations

• The number of stable matchings in models of the Gale-Shapley type with preferences given by partial orders
• A simply exponential upper bound on the maximum number of stable matchings
• A note on stable matchings
• Stable husbands
• On a characterization of stable matchings

Cites work

• College Admissions and the Stability of Marriage
• Concerning the maximum number of stable matchings in the stable marriage problem
• How do I marry thee? Let me count the ways
• scientific article; zbMATH DE number 477584 (Why is no real title available?)
• The complexity of approximately counting stable roommate assignments
• The Complexity of Counting Stable Marriages
• The two-sided matching problem. Origin, development and current issues

Cited in

(13)

• Stable matchings and equilibrium outcomes of the Gale-Shapley's algorithm for the marriage problem
• Concerning the maximum number of stable matchings in the stable marriage problem
• The stable marriage problem: an interdisciplinary review from the physicist's perspective
• On the number of employed in the matching model
• A note on the uniqueness of stable marriage matching
• On matchings, marriages and college admissions
• A note on stable matchings
• The number of stable matchings in models of the Gale-Shapley type with preferences given by partial orders
• Mallows permutations as stable matchings
• An extendable stable matching algorithm of a kind of bipartite graph
• Algorithms and Computation
• Review of the theory of stable matchings and contract systems
• On the set of stable matchings in a bipartite graph

This page was built for publication: A number of stable matchings in models of the Gale-Shapley type

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