Péter Biró and Tamás Fleiner were consulted in 2007 when the matching mechanism of the Hungarian college admission scheme was redesigned. Based on this collaboration we studied the underlying matching problems with a number of foreign colleagues, including David Manlove, Rob Irving, Ian McBride, and Sofia Kiselgof, and with our group members Kolos Ágoston, Zsuzsanna Jankó and Endre Kováts. Currently we are conducting theoretical researches by using IP techniques for solving the complex matching problem arising from a number of special features, such as lower quotas, common quotas, paired studies and ties. We conduct simulations on a complete real data from 2008 provided by the responsible organisation, and also on a different administrative data from 2001-2016 provided by the Databank of KRTK. Finally, we are developing a web-application to facilitate the admission to so-called dual programmes in 2019. In these dual programmes the students are applying to university programmes joined with company internships, and the latter selections by the companies are not yet centrally coordinated.
Related scientific publications:
K.Cs. Ágoston, P. Biró and Iain McBride, Integer programming methods for special college admissions problems. Journal of Combinatorial Optimization 32(4), (2016) pp:1371-1399
Biró and S. Kiselgof, College admissions with stable score-limits. Central European Journal of Operations Research, 23(4) (2015) pp:727-741
Biró, T. Fleiner, R.W. Irving and D.F. Manlove, The College Admissions problem with lower and common quotas. Theoretical Computer Science, 411 (2010) pp:3136–3153
See more details here: http://www.matching-in-practice.eu/higher-education-in-hungary/