Pages that link to "Item:Q1821125"
From MaRDI portal
The following pages link to Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (Q1821125):
Displayed 18 items.
- Complexity of the sex-equal stable marriage problem (Q689901) (← links)
- A unifying approach to the structures of the stable matching problems (Q808729) (← links)
- Interior points in the core of two-sided matching markets (Q1110430) (← links)
- Linear programming brings marital bliss (Q1122480) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- Representation of lattices via set-colored posets (Q1800386) (← links)
- An efficient algorithm for batch stability testing (Q1959725) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Faster algorithms for stable allocation problems (Q1959735) (← links)
- Entering classes in the college admissions model (Q2212783) (← links)
- Complexity study for the robust stable marriage problem (Q2419115) (← links)
- The graphs of stably matchable pairs (Q2672447) (← links)
- Counterexamples of small size for three-sided stable matching with cyclic preferences (Q2678463) (← links)
- A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences (Q2700602) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Marriage and Roommate (Q6066467) (← links)