Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/190456 
Year of Publication: 
2016
Series/Report no.: 
IEHAS Discussion Papers No. MT-DP - 2016/32
Publisher: 
Hungarian Academy of Sciences, Institute of Economics, Budapest
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 Hungarian 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 other similar applications. We finish the paper by presenting a simulation using the 2008 data of the Hungarian higher education admission scheme.
Subjects: 
College admissions problem
integer programming
stable score-limits
lower quotas
common quotas
paired applications
simulations
JEL: 
C61
C63
C78
ISBN: 
978-615-5594-73-1
Document Type: 
Working Paper

Files in This Item:
File
Size
504.25 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.