scientific article
From MaRDI portal
Publication:2721985
zbMath0966.91500MaRDI QIDQ2721985
Robert W. Irving, David F. Manlove, Sandy Scott
Publication date: 11 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings ⋮ Randomized approximation of the stable marriage problem ⋮ Equivalence of two-sided stable matching ⋮ Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints ⋮ A Matroid Generalization of the Super-Stable Matching Problem ⋮ Two problems in max-size popular matchings ⋮ Review of the theory of stable matchings and contract systems ⋮ Distance on matchings: An axiomatic approach ⋮ Core and stability notions in many-to-one matching markets with indifferences ⋮ Lazy Gale-Shapley for many-to-one matching with partial information ⋮ The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences ⋮ Approximability results for stable marriage problems with ties. ⋮ Two algorithms for the student-project allocation problem ⋮ A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem ⋮ On the complexity of distributed stable matching with small messages ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Strongly stable and maximum weakly stable noncrossing matchings ⋮ Three-sided stable matching problem with two of them as cooperative partners ⋮ Three-dimensional stable matching with hybrid preferences ⋮ Deferred acceptance algorithms: history, theory, practice, and open questions ⋮ Improving solution times for stable matching problems through preprocessing ⋮ An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm ⋮ The stable marriage problem with master preference lists ⋮ Super-stability in the student-project allocation problem with ties ⋮ Stable matchings in the marriage model with indifferences ⋮ Pairwise Preferences in the Stable Marriage Problem ⋮ Coalitional permutation manipulations in the Gale-Shapley algorithm ⋮ Stable matching with uncertain linear preferences ⋮ Stable marriage with ties and bounded length preference lists ⋮ Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints ⋮ Unnamed Item ⋮ Hard variants of stable marriage. ⋮ The hospitals/residents problem with lower quotas
This page was built for publication:
