Pages that link to "Item:Q986550"
From MaRDI portal
The following pages link to The college admissions problem with lower and common quotas (Q986550):
Displayed 46 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Strategyproof matching with regional minimum and maximum quotas (Q274410) (← links)
- Modelling practical placement of trainee teachers to schools (Q301931) (← links)
- College admissions with stable score-limits (Q302118) (← links)
- Stable matchings of teachers to schools (Q329714) (← links)
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- Integer programming methods for special college admissions problems (Q346530) (← links)
- Stability concepts in matching under distributional constraints (Q508390) (← links)
- Dynamic reserves in matching markets (Q785541) (← links)
- Finding all stable matchings with couples (Q908185) (← links)
- The college admissions problem with lower and common quotas (Q986550) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Handling preferences in student-project allocation (Q1730741) (← links)
- Finding a stable matching under type-specific minimum quotas (Q1757561) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Graduate admission with financial support (Q1985735) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Slot-specific priorities with capacity transfers (Q2049501) (← links)
- Envy-free matchings with one-sided preferences and matroid constraints (Q2060385) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- Interdistrict school choice: a theory of student assignment (Q2138086) (← links)
- University rankings from the revealed preferences of the applicants (Q2184118) (← 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)
- Pareto optimal matchings with lower quotas (Q2409711) (← links)
- Agreeable sets with matroidal constraints (Q2424653) (← links)
- Matching with quorums (Q2440142) (← links)
- A note on the serial dictatorship with project closures (Q2450713) (← links)
- The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- A Matroid Approach to Stable Matchings with Lower Quotas (Q2806830) (← links)
- MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY (Q2854007) (← links)
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas (Q2976150) (← links)
- Stable Matching with Proportionality Constraints (Q5129207) (← links)
- Assignment Mechanisms Under Distributional Constraints (Q5131470) (← links)
- (Q5136288) (← links)
- Popular Matchings with Lower Quotas (Q5136336) (← links)
- (Q5743384) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas (Q6109545) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6113860) (← links)
- Cutoff stability under distributional constraints with an application to summer internship matching (Q6120933) (← links)
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective (Q6162047) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6201324) (← links)