Capacity design in school choice
From MaRDI portal
Publication:6584598
Recommendations
Cites work
- A tale of two mechanisms: Student placement
- Constrained school choice
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Efficient Resource Allocation on the Basis of Priorities
- Family ties: school assignment with siblings
- Games of capacity manipulation in hospital-intern markets
- Implementation in Undominated Strategies: A Look at Bounded Mechanisms
- Improving matching under hard distributional constraints
- Introduction to algorithms
- Machiavelli and the Gale-Shapley Algorithm
- Manipulation via capacities in two-sided matching markets
- Manipulation via capacities revisited
- Object allocation via deferred-acceptance: strategy-proofness and comparative statics
- On two competing mechanisms for priority-based allocation problems
- On two kinds of manipulation for school choice problems
- School Choice with Consent*
- School choice: an experimental study
- Self-selection in school choice
- Sequential school choice with public and private schools
- Slot-specific priorities with capacity transfers
- Two simple variations of top trading cycles
- When Can Manipulations be Avoided in Two-Sided Matching Markets? -- Maximal Domain Results
This page was built for publication: Capacity design in school choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584598)
