Matching and its Applications to the Admission Processes by Sydney Rainer ’20, pre-recorded

Matching and its Applications to the Admission Processes by Sydney Rainer ’20, Wednesday, April 15, 1-1:45 pm, Mathematics Colloquium, pre-recorded, link to appear

Abstract:  We will think about the admission process in primary and secondary education as a matching problem where we are trying to match students and programs. In particular, we are interested in finding perfect and stable matchings that are optimal for students. To ground this problem, we will first look at classic matching problems such as the stable marriage problem and the stable roommate problem. In this discussion, we will explore two algorithms – the Gale-Shapley algorithm and the Irving algorithm. We will then consider applications of these algorithms in primary and secondary education matching programs and evaluate whether or not these systems meet the sufficient conditions.

To access colloquium: https://williams.zoom.us/j/96617985543?pwd=blBZcUh5MUFPTXBJOWxydWY4WUlEdz09