The set of super-stable marriages forms a distributive lattice
From MaRDI portal
Publication:1805466
DOI10.1016/0166-218X(94)00080-WzbMath0817.06012MaRDI QIDQ1805466
Publication date: 17 May 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributive lattices (06D99)
Related Items
The structure of stable marriage with indifference, Characterization of super-stable matchings, Jointly stable matchings, Marriage market with indifferences: a linear programming approach, 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, Pairwise Preferences in the Stable Marriage Problem, Unnamed Item
Cites Work
