Pages that link to "Item:Q274410"
From MaRDI portal
The following pages link to Strategyproof matching with regional minimum and maximum quotas (Q274410):
Displaying 15 items.
- Finding a stable matching under type-specific minimum quotas (Q1757561) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Impossibility of weakly stable and strategy-proof mechanism (Q2159837) (← links)
- Stable fractional matchings (Q2238635) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Strategy-proof school choice mechanisms with minimum quotas and initial endowments (Q2409677) (← links)
- Matching with quorums (Q2440142) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- (Q5136288) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Cutoff stability under distributional constraints with an application to summer internship matching (Q6120933) (← links)
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6201324) (← links)