2000 character limit reached
A Cost-Minimizing Algorithm for School Choice (1010.2312v2)
Published 12 Oct 2010 in math.OC, cs.GT, and math.CO
Abstract: The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. In this note we define a simple student-optimal criterion that is not met by any previously employed mechanism in the school choice literature. We then use this criterion to adapt a well-known combinatorial optimization technique (Hungarian algorithm) to the school choice problem.