A Cost-Minimizing Algorithm for School Choice
Optimization and Control
2013-04-30 v2 Computer Science and Game Theory
Combinatorics
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.
Cite
@article{arxiv.1010.2312,
title = {A Cost-Minimizing Algorithm for School Choice},
author = {Sinan Aksoy and Adam Azzam and Chaya Coppersmith and Julie Glass and Gizem Karaali and Xueying Zhao and Xinjing Zhu},
journal= {arXiv preprint arXiv:1010.2312},
year = {2013}
}
Comments
ISAIM 2012 (International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012) Proceedings, 2012