Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
From MaRDI portal
Publication:1821125
DOI10.1016/0097-3165(87)90037-9zbMath0616.06009MaRDI QIDQ1821125
Robert W. Irving, Dan Gusfield, Michael E. Saks, Paul Leather
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(87)90037-9
weak dominance; partial order; finite distributive lattice; stable marriage problem; meet-irreducibles; preference list
06A06: Partial orders, general
05A05: Permutations, words, matrices
06D05: Structure and representation theory of distributive lattices
Related Items
Complexity of the sex-equal stable marriage problem, A unifying approach to the structures of the stable matching problems, Interior points in the core of two-sided matching markets, Linear programming brings marital bliss, A new fixed point approach for stable networks and stable marriages, Network flow and 2-satisfiability, An efficient algorithm for batch stability testing, Parameterized complexity and local search approaches for the stable marriage problem with ties, Faster algorithms for stable allocation problems, The Price of Matching with Metric Preferences
Cites Work
