Stable matching with proportionality constraints
From MaRDI portal
Recommendations
- Stability concepts in matching under distributional constraints
- Constrained random matching
- Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
- Distributed Stable Matching Problems
- Designing matching mechanisms under constraints: an approach from discrete convex analysis
Cites work
- A matroid approach to stable matchings with lower quotas
- Classified stable matching
- Designing matching mechanisms under constraints: an approach from discrete convex analysis
- Effective affirmative action in school choice
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Improving matching under hard distributional constraints
- School choice with controlled choice constraints: hard bounds versus soft bounds
- School choice: impossibilities for affirmative action
- The college admissions problem with lower and common quotas
- The Core of an N Person Game
Cited in
(21)- Sustainable matching plans with adverse selection
- Slot-specific priorities with capacity transfers
- Power indices for networks, with applications to matching markets
- Interdistrict school choice: a theory of student assignment
- Constrained random matching
- Procedurally fair and stable matching
- Stable matchings of teachers to schools
- Stability concepts in matching under distributional constraints
- Affinely representable lattices, stable matchings, and choice functions
- Affinely representable lattices, stable matchings, and choice functions
- Cutoff stability under distributional constraints with an application to summer internship matching
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
- Efficient matching under general constraints
- Fair matching under constraints: theory and applications
- Finding all stable matchings with assignment constraints
- A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization
- Quota implementation in assignment games
- Meritocracy versus diversity
- Efficient and strategy-proof mechanism under general constraints
- The complexity of finding fair many-to-one matchings
- Scarf's algorithm on arborescence hypergraphs
This page was built for publication: Stable matching with proportionality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129207)
