Cutoff stability under distributional constraints with an application to summer internship matching
From MaRDI portal
Publication:6120933
DOI10.1007/s10107-022-01917-1arXiv2102.02931OpenAlexW3126619938MaRDI QIDQ6120933
Haris Aziz, Péter Biró, Anton Baychkov
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.02931
Cites Work
- Unnamed Item
- Strategyproof matching with regional minimum and maximum quotas
- College admissions with stable score-limits
- Integer programming methods for special college admissions problems
- Stability concepts in matching under distributional constraints
- Two algorithms for the student-project allocation problem
- The college admissions problem with lower and common quotas
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- A tale of two mechanisms: Student placement
- The stable admissions polytope
- Hard variants of stable marriage.
- Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
- Mathematical models for stable matching problems with ties and incomplete lists
- Decreasing minimization on M-convex sets: background and structures
- Impossibility of weakly stable and strategy-proof mechanism
- Deferred acceptance algorithms: history, theory, practice, and open questions
- Controlled School Choice with Soft Bounds and Overlapping Types
- Improved approximation results for the stable marriage problem
- Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
- Improving matching under hard distributional constraints
- Weighted Matching Markets with Budget Constraints
- Algorithmics of Matching Under Preferences
- College Admissions and the Stability of Marriage
This page was built for publication: Cutoff stability under distributional constraints with an application to summer internship matching
