The structure of stable marriage with indifference

DOI10.1016/S0166-218X(01)00322-5zbMath1008.05117MaRDI QIDQ1613420

David F. Manlove

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

distributive latticestrong stabilitypartial orderstable marriage problemsuper-stabilitytie

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structure and representation theory of distributive lattices (06D05)

Related Items (19)

Characterization of super-stable matchings ⋮ On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) ⋮ Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings ⋮ Strategyproof mechanism for two-sided matching with resource allocation ⋮ Jointly stable matchings ⋮ Core and stability notions in many-to-one matching markets with indifferences ⋮ A simple matching domain with indifferences and a master list ⋮ Parameterized algorithms for stable matching with ties and incomplete lists ⋮ Stability, optimality and manipulation in matching problems with weighted preferences ⋮ Stable marriage with general preferences ⋮ Unnamed Item ⋮ Efficient algorithms for generalized stable marriage and roommates problems ⋮ Super-stability in the student-project allocation problem with ties ⋮ Stable matchings in the marriage model with indifferences ⋮ Three-sided matching problem with mixed preferences ⋮ Pairwise Preferences in the Stable Marriage Problem ⋮ Unnamed Item ⋮ The stable marriage problem with ties and restricted edges ⋮ Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preference structures and their numerical representations
• Stable marriage and indifference
• Finding all the perfect matchings in bipartite graphs
• Hard variants of stable marriage.
• The set of super-stable marriages forms a distributive lattice
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• College Admissions and the Stability of Marriage

This page was built for publication: The structure of stable marriage with indifference