Quota implementation in assignment games
From MaRDI portal
Cites work
- A new solution to the random assignment problem.
- Capacity design in school choice
- College Admissions and the Stability of Marriage
- Cores of convex games
- Effective affirmative action in school choice
- Generalized reduced-form auctions: a network-flow approach
- Implementation of Reduced Form Auctions: A Geometric Approach
- Improving matching under hard distributional constraints
- Lectures on Polytopes
- Mechanism design. A linear programming approach.
- On the Implementability of Reduced Form Auctions
- Priority Design in Centralized Matching Markets
- School choice with controlled choice constraints: hard bounds versus soft bounds
- School choice: impossibilities for affirmative action
- Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
- Stable matching with proportionality constraints
- Submodular functions and optimization.
- Symmetric reduced-form voting
- The assignment game. I: The core
This page was built for publication: Quota implementation in assignment games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6893295)