Pages that link to "Item:Q964402"
From MaRDI portal
The following pages link to Size versus stability in the marriage problem (Q964402):
Displaying 29 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- The stable roommates problem with short lists (Q1733384) (← links)
- Application of pair approximation method to modeling and analysis of a marriage network (Q1734321) (← links)
- Maximum locally stable matchings (Q1736563) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- (Un)stable matchings with blocking costs (Q2060342) (← links)
- Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Robust and approximately stable marriages under partial information (Q2190410) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- Size versus fairness in the assignment problem (Q2343388) (← links)
- Popularity in the generalized hospital residents setting (Q2399378) (← links)
- On the number of employed in the matching model (Q2425191) (← links)
- Matching formulation of the staff transfer problem: meta-heuristic approaches (Q2656523) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY (Q2854007) (← links)
- Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability (Q3449578) (← links)
- Size Versus Stability in the Marriage Problem (Q3602826) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- How Good Are Popular Matchings (Q5140718) (← links)
- (Q5743383) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- The complexity of matching games: a survey (Q6488787) (← links)
- Maximum matchings and popularity (Q6490278) (← links)
