Integer programming methods for special college admissions problems
From MaRDI portal
Publication:346530
DOI10.1007/s10878-016-0085-xzbMath1356.90119arXiv1408.6878OpenAlexW2167798820MaRDI QIDQ346530
Péter Biró, Iain McBride, Kolos Csaba Ágoston
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.6878
integer programmingsimulationscollege admissions problemcommon quotaslower quotaspaired applicationsstable score-limits
Related Items (11)
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach ⋮ University rankings from the revealed preferences of the applicants ⋮ Review of the theory of stable matchings and contract systems ⋮ Stable matching: An integer programming approach ⋮ Online voluntary mentoring: optimising the assignment of students and mentors ⋮ Cutoff stability under distributional constraints with an application to summer internship matching ⋮ Novel integer programming models for the stable kidney exchange problem ⋮ Mathematical models for stable matching problems with ties and incomplete lists ⋮ Stable fractional matchings ⋮ Complexity of finding Pareto-efficient allocations of highest welfare ⋮ College admissions with ties and common quotas: integer programming approach
Cites Work
- College admissions with stable score-limits
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- The college admissions problem with lower and common quotas
- Stable matching problems with exchange restrictions
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Some remarks on the stable matching problem
- Characterization of stable matchings as extreme points of a polytope
- On the stable \(b\)-matching polytope.
- The stable admissions polytope
- Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
- MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY
- Integer Programming Methods for Special College Admissions Problems
- NP-complete stable matching problems
- Stable Matchings, Optimal Assignments, and Linear Programming
- Many-to-One Stable Matching: Geometry and Fairness
- Stable matching with couples
- College Admissions and the Stability of Marriage
- Backward unraveling over time: The evolution of strategic behavior in the entry level British medical labor markets
This page was built for publication: Integer programming methods for special college admissions problems
