Pages that link to "Item:Q500490"
From MaRDI portal
The following pages link to The stability of many-to-many matching with max-min preferences (Q500490):
Displaying 18 items.
- \(d\)-dimensional stable matching with cyclic preferences (Q309847) (← links)
- A many-to-many `rural hospital theorem' (Q462856) (← links)
- Many-to-many matching with max-min preferences (Q477355) (← links)
- The blocking lemma and strategy-proofness in many-to-many matchings (Q523460) (← links)
- On the invariance of the set of core matchings with respect to preference profiles (Q765218) (← links)
- Three remarks on the many-to-many stable matching problem (Q1303882) (← links)
- Stability of matchings when individuals have preferences over colleagues (Q1368881) (← links)
- Implementation in the many-to-many matching market. (Q1420524) (← links)
- Equivalence of two-sided stable matching (Q1631687) (← links)
- Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- A one-sided many-to-many matching problem (Q2402821) (← links)
- Hedonic games related to many-to-one matching problems (Q2450143) (← links)
- Credible group stability in many-to-many matching problems (Q2496782) (← links)
- Transfers and exchange-stability in two-sided matching problems (Q2629324) (← links)
- Finding a minimum-regret many-to-many Stable Matching (Q2868914) (← links)
- Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition (Q4682746) (← links)
- Many-to-One Stable Matching: Geometry and Fairness (Q5387998) (← links)
