Pages that link to "Item:Q406428"
From MaRDI portal
The following pages link to School choice with controlled choice constraints: hard bounds versus soft bounds (Q406428):
Displayed 50 items.
- Strategyproof matching with regional minimum and maximum quotas (Q274410) (← links)
- Fair implementation of diversity in school choice (Q290161) (← links)
- Object allocation via deferred-acceptance: strategy-proofness and comparative statics (Q290170) (← links)
- Responsive affirmative action in school choice (Q308606) (← links)
- An analysis of the German university admissions system (Q361830) (← links)
- Stability concepts in matching under distributional constraints (Q508390) (← links)
- Dynamic reserves in matching markets (Q785541) (← links)
- Affirmative actions: the Boston mechanism case (Q1668177) (← links)
- Affirmative action in school choice: a new solution (Q1748535) (← links)
- The lattice of envy-free matchings (Q1753285) (← links)
- The skipping-down strategy and stability in school choice problems with affirmative action: theory and experiment (Q1753287) (← 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)
- A college admissions clearinghouse (Q1757598) (← links)
- Two further impossibility results on responsive affirmative action in school choice (Q1787522) (← links)
- On lexicographic choice (Q1788027) (← links)
- Graduate admission with financial support (Q1985735) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- School choice with priority-based affirmative action: a responsive solution (Q1996170) (← links)
- A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences (Q2034808) (← links)
- Fairness and efficiency for allocations with participation constraints (Q2044984) (← links)
- Slot-specific priorities with capacity transfers (Q2049501) (← links)
- School choice with hybrid schedules (Q2052531) (← links)
- Coalitional permutation manipulations in the Gale-Shapley algorithm (Q2060701) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- College admissions with tuition transfers (Q2078089) (← links)
- A comparison study on responsiveness of three mechanisms to affirmative action in school choice (Q2084017) (← links)
- When is the deferred acceptance mechanism responsive to priority-based affirmative action? (Q2125094) (← links)
- Interdistrict school choice: a theory of student assignment (Q2138086) (← links)
- Constrained random matching (Q2155237) (← links)
- Impossibility of weakly stable and strategy-proof mechanism (Q2159837) (← links)
- Explicit vs. statistical targeting in affirmative action: theory and evidence from Chicago's exam schools (Q2173082) (← links)
- Matching through institutions (Q2173398) (← links)
- Comparative statics for size-dependent discounts in matching markets (Q2201710) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Responsive affirmative action in school choice: a comparison study (Q2311161) (← links)
- On the welfare effects of affirmative actions in school choice (Q2318120) (← links)
- Random matching under priorities: stability and no envy concepts (Q2325654) (← links)
- Strategy-proof school choice mechanisms with minimum quotas and initial endowments (Q2409677) (← links)
- Pareto optimal matchings with lower quotas (Q2409711) (← links)
- Strategy-proof Pareto-improvement (Q2415985) (← links)
- Menu mechanisms (Q2675411) (← links)
- School choice with preference rank classes (Q2681516) (← links)
- A Matroid Approach to Stable Matchings with Lower Quotas (Q2806830) (← links)
- The Complexity of Computing the Random Priority Allocation Matrix (Q3465944) (← links)
- Improving the Chilean College Admissions System (Q5031616) (← links)
- Stable Matching with Proportionality Constraints (Q5129207) (← links)
- Assignment Mechanisms Under Distributional Constraints (Q5131470) (← links)
- (Q5136288) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)