Search Results - subject:"College Admissions Problem"

Integer programming methods for special college admissions problems

Ágoston, Kolos Csaba; Biró, Péter; McBride, Iain - 2016

college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the …

Persistent link: https://www.econbiz.de/10011944892

Integer programming methods for special college admissions problems

Ágoston, Kolos Csaba; Biró, Péter; McBride, Iain - 2016

college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the …

Persistent link: https://www.econbiz.de/10011562748

Median Stable Matching for College Admission

Klaus, Bettina; Klijn, Flip - Departament d'Economia i Història Econòmica, … - 2004

We give a simple and concise proof that so-called generalized median stable matchings are well-defined stable matchings for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions...

Persistent link: https://www.econbiz.de/10005572262

Manipulation and Stability in the College Admissions Problem

Ma, Jinpeng - 1997

admissions problem and shows that all rematching proof or strong equilibria in truncations produce stable matchings, even though … in an example that the unstable matchings can arise at Nash equilibria in truncations. This paper studies the college …

Persistent link: https://www.econbiz.de/10010334341

Manipulation and stability in the college admissions problem

Ma, Jinpeng - 1997 - This version March 30, 1997

Persistent link: https://www.econbiz.de/10011577122