Integer programming methods for special college admissions problems
From MaRDI portal
Publication:346530
Abstract: We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired applications. We note that each of the latter three special feature makes the college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the application. The IP methods that we propose are not only interesting theoretically, but may also serve as an alternative solution concept for this practical application, and also for other ones.
Recommendations
- Integer programming methods for special college admissions problems
- Integer programming techniques for college admission problem with common quotas
- College admissions with ties and common quotas: integer programming approach
- The college admissions problem with lower and common quotas
- College admissions with stable score-limits
Cites work
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Backward unraveling over time: The evolution of strategic behavior in the entry level British medical labor markets
- Characterization of stable matchings as extreme points of a polytope
- Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
- College Admissions and the Stability of Marriage
- College admissions with stable score-limits
- Integer programming methods for special college admissions problems
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Many-to-One Stable Matching: Geometry and Fairness
- Matching with couples: a multidisciplinary survey
- NP-complete stable matching problems
- On the stable \(b\)-matching polytope.
- Some remarks on the stable matching problem
- Stable Matchings, Optimal Assignments, and Linear Programming
- Stable matching problems with exchange restrictions
- Stable matching with couples: an empirical study
- The college admissions problem with lower and common quotas
- The stable admissions polytope
Cited in
(17)- Integer programming techniques for college admission problem with common quotas
- College admissions with ties and common quotas: integer programming approach
- Review of the theory of stable matchings and contract systems
- Complexity of finding Pareto-efficient allocations of highest welfare
- The singleton core in the college admissions problem and its application to the national resident matching program (NRMP)
- Integer programming methods for special college admissions problems
- Mathematical models for stable matching problems with ties and incomplete lists
- Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach
- University rankings from the revealed preferences of the applicants
- Stable matching: An integer programming approach
- Optimization methods and algorithms
- Online voluntary mentoring: optimising the assignment of students and mentors
- A nonlinear goal programming model for university admission capacity planning with modified differential evolution algorithm
- The sorting hat goes to college
- Stable fractional matchings
- Cutoff stability under distributional constraints with an application to summer internship matching
- Novel integer programming models for the stable kidney exchange problem
This page was built for publication: Integer programming methods for special college admissions problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346530)
