Pages that link to "Item:Q1805466"
From MaRDI portal
The following pages link to The set of super-stable marriages forms a distributive lattice (Q1805466):
Displaying 12 items.
- Every finite distributive lattice is a set of stable matchings (Q798345) (← links)
- Characterization of super-stable matchings (Q832893) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- The structure of stable marriage with indifference (Q1613420) (← links)
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (Q1821125) (← links)
- Stable matchings in the marriage model with indifferences (Q2059169) (← links)
- Jointly stable matchings (Q2424832) (← links)
- Marriage market with indifferences: a linear programming approach (Q2687690) (← links)
- On the stability of marriages (Q3979185) (← links)
- Pairwise Preferences in the Stable Marriage Problem (Q5090469) (← links)
- Jointly stable matchings (Q5136277) (← links)
- Super-stability in the student-project allocation problem with ties (Q5918742) (← links)