Paper Info
Title
Stable matchings of teachers to schools.
Abstract
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning teachers to schools. Our model is motivated by a particular characteristic of the education system in many countries where each teacher specializes in two subjects. We seek stable matchings, which ensure that no teacher and school have the incentive to deviate from their assignments. Indeed we propose two stability definitions depending on the precise format of schools' preferences. If the schools' ranking of applicants is independent of their subjects of specialism, we show that the problem of deciding whether a stable matching exists is NP-complete, even if there are only three subjects, unless there are master lists of applicants or of schools. By contrast, if the schools may order applicants differently in each of their specialization subjects, the problem of deciding whether a stable matching exists is NP-complete even in the presence of subject-specific master lists plus a master list of schools. Finally, we prove a strong inapproximability result for the problem of finding a matching with the minimum number of blocking pairs with respect to both stability definitions.
Year
DOI
Venue
2015
10.1016/j.tcs.2016.09.014
Theoretical Computer Science
Keywords
Field
DocType
Stable matchings,Serial dictatorship,NP-completeness,Polynomial-time algorithm,Inapproximability
Combinatorics,Incentive,Ranking,Higher education,Mathematics
Journal
Volume
ISSN
Citations 
653
0304-3975
2
PageRank 
References 
Authors
0.40
10
4
Name
Order
Citations
PageRank
Katarína Cechlárová122628.02
Tamás Fleiner224127.45
David F. Manlove376160.45
Iain McBride4102.64