Stable matchings of teachers to schools

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 char...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 653; pp. 15 - 25
Main Authors: Cechlárová, Katarína, Fleiner, Tamás, Manlove, David F., McBride, Iain
Format: Journal Article
Language:English
Published: Elsevier B.V 15.11.2016
Subjects:
Computer simulation
Education
Inapproximability
Incentives
Lists
Markets
Matching
NP-completeness
Polynomial-time algorithm
Serial dictatorship
Stability
Stable matchings
Teachers
Polynomial-time algorithm
Serial dictatorship
Inapproximability
Stable matchings
NP-completeness
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.09.014