Pages that link to "Item:Q261379"
From MaRDI portal
The following pages link to The hospitals/residents problem with lower quotas (Q261379):
Displaying 18 items.
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Pareto optimal matchings with lower quotas (Q2409711) (← links)
- Two problems in max-size popular matchings (Q2415362) (← links)
- A Matroid Approach to Stable Matchings with Lower Quotas (Q2806830) (← links)
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas (Q2976150) (← links)
- Assignment Mechanisms Under Distributional Constraints (Q5131470) (← links)
- (Q5136288) (← links)
- (Q5136309) (← links)
- Popular Matchings with Lower Quotas (Q5136336) (← links)
- How Good Are Popular Matchings (Q5140718) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective (Q6162047) (← links)
- Popular critical matchings in the many-to-many setting (Q6199405) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6201324) (← links)
