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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 653; s. 15 - 25
Hlavní autori:	Cechlárová, Katarína, Fleiner, Tamás, Manlove, David F., McBride, Iain
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.11.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

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.
AbstractList	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.
Author	McBride, Iain Manlove, David F. Cechlárová, Katarína Fleiner, Tamás
Author_xml	– sequence: 1 givenname: Katarína surname: Cechlárová fullname: Cechlárová, Katarína email: katarina.cechlarova@upjs.sk organization: Institute of Mathematics, Faculty of Science, P.J. Šafárik University, Jesenná 5, 040 01 Košice, Slovakia – sequence: 2 givenname: Tamás surname: Fleiner fullname: Fleiner, Tamás email: fleiner@cs.bme.hu organization: Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Magyar tudósok körútja 2, H-1117 Budapest, Hungary – sequence: 3 givenname: David F. surname: Manlove fullname: Manlove, David F. email: david.manlove@glasgow.ac.uk organization: School of Computing Science, Sir Alwyn Williams Building, University of Glasgow, Glasgow, G12 8QQ, UK – sequence: 4 givenname: Iain surname: McBride fullname: McBride, Iain email: i.mcbride.1@research.gla.ac.uk organization: School of Computing Science, Sir Alwyn Williams Building, University of Glasgow, Glasgow, G12 8QQ, UK
BookMark	eNp9kLFOwzAQhi1UJNrCA7BlgyXBjuM4FhOqKCBVYgBmyzlfqKs0LraLxNuTqkwMveXupP876b4ZmQx-QEKuGS0YZfXdpkgQi3IcC6oKyqozMmWNVHlZqmpCppTTKudKigsyi3FDxxKynpKbt2TaHrOtSbB2w2fMfJclNLDGELPkswhr7_t4Sc4700e8-utz8rF8fF8856vXp5fFwyoHLnnKsVWKiQo4U2UrFFWtoMIqtBXKtmuMshxrqzprwQhBOxhXgJKXitOWyZLPye3x7i74rz3GpLcuAva9GdDvo2aNELyWjTpE2TEKwccYsNO74LYm_GhG9UGK3uhRij5I0VTpUcrIyH8MuGSS80MKxvUnyfsjieP33w6DjuBwALQuICRtvTtB_wLEPX1u
CitedBy_id	crossref_primary_10_1007_s10878_017_0231_0 crossref_primary_10_1109_ACCESS_2019_2906560 crossref_primary_10_1007_s40593_020_00224_0 crossref_primary_10_1016_j_seps_2021_101191 crossref_primary_10_3390_a18050250
Cites_doi	10.1016/j.tcs.2010.05.005 10.1257/000282805774670167 10.1145/1963190.1970372 10.1086/261272 10.1007/s00182-008-0117-6 10.3102/0002831209345157 10.1016/0196-6774(90)90007-2 10.1007/s10100-014-0356-5 10.1016/j.dam.2008.01.002 10.1007/s10878-009-9257-2 10.2307/2312726 10.1257/000282805774669637 10.1023/A:1022109006658
ContentType	Journal Article
Copyright	2016 The Author(s)
Copyright_xml	– notice: 2016 The Author(s)
DBID	6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.tcs.2016.09.014
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science Education
EISSN	1879-2294
EndPage	25
ExternalDocumentID	10_1016_j_tcs_2016_09_014 S0304397516305011
GrantInformation_xml	– fundername: VEGA grantid: 1/0344/14; 1/0142/15; APVV-15-0091 funderid: http://dx.doi.org/10.13039/501100006109 – fundername: COST grantid: IC1205 funderid: http://dx.doi.org/10.13039/501100000921 – fundername: ELTE-MTA Egerváry Research Group – fundername: SICSA – fundername: EPSRC grantid: EP/K010042/1 funderid: http://dx.doi.org/10.13039/501100000266 – fundername: OTKA grantid: K108383 funderid: http://dx.doi.org/10.13039/501100003549
GroupedDBID	--K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c373t-eb99154c3192b5909b505d9ed4e7bf8a9d3e6d9fddca550fc3e6cc232930b1723
ISICitedReferencesCount	7
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000387627500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0304-3975
IngestDate	Thu Oct 02 12:16:20 EDT 2025 Sat Nov 29 05:15:25 EST 2025 Tue Nov 18 22:38:27 EST 2025 Fri Feb 23 02:30:25 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Keywords	Polynomial-time algorithm Serial dictatorship Inapproximability Stable matchings NP-completeness
Language	English
License	This is an open access article under the CC BY license.
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c373t-eb99154c3192b5909b505d9ed4e7bf8a9d3e6d9fddca550fc3e6cc232930b1723
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
OpenAccessLink	https://dx.doi.org/10.1016/j.tcs.2016.09.014
PQID	1855367892
PQPubID	23500
PageCount	11
ParticipantIDs	proquest_miscellaneous_1855367892 crossref_primary_10_1016_j_tcs_2016_09_014 crossref_citationtrail_10_1016_j_tcs_2016_09_014 elsevier_sciencedirect_doi_10_1016_j_tcs_2016_09_014
PublicationCentury	2000
PublicationDate	2016-11-15
PublicationDateYYYYMMDD	2016-11-15
PublicationDate_xml	– month: 11 year: 2016 text: 2016-11-15 day: 15
PublicationDecade	2010
PublicationTitle	Theoretical computer science
PublicationYear	2016
Publisher	Elsevier B.V
Publisher_xml	– name: Elsevier B.V
References	Biró, Fleiner, Irving, Manlove (br0060) 2010; 411 Abdulkadiroǧlu, Pathak, Roth (br0010) 2005; 95 Hawkes (br0110) 4 March 2006 Van Dooren, Verschaffel (br0090) 2003; 6 br0210 Irving, Manlove, Scott (br0130) 2008; 156 Roth, Sotomayor (br0190) 1990; vol. 18 Emparelhamentos (br0200) 2005 Biró, Irving, Schlotter (br0070) 2011; 16 Irving (br0120) 1998; vol. 1461 Roth (br0170) 1984; 92 Gale, Shapley (br0100) 1962; 69 Manlove (br0140) 2013 Roth (br0180) 2008; 36 Abdulkadiroǧlu, Pathak, Roth (br0020) 2005; 95 Cechlárová, Fleiner, Manlove, McBride, Potpinková (br0080) 2015; 23 Ronn (br0160) 1990; 11 Baumert, Kunter, Blum, Brunner, Voss, Jordan, Klusmann, Krauss, Neubrand, Tsai (br0040) 2010; 47 McDermid, Manlove (br0150) 2010; 19 Berman, Karpinski, Scott (br0050) 2003 Abraham, Biró, Manlove (br0030) 2006; vol. 3879 Baumert (10.1016/j.tcs.2016.09.014_br0040) 2010; 47 McDermid (10.1016/j.tcs.2016.09.014_br0150) 2010; 19 Roth (10.1016/j.tcs.2016.09.014_br0170) 1984; 92 Biró (10.1016/j.tcs.2016.09.014_br0070) 2011; 16 Abdulkadiroǧlu (10.1016/j.tcs.2016.09.014_br0010) 2005; 95 Emparelhamentos (10.1016/j.tcs.2016.09.014_br0200) 2005 Cechlárová (10.1016/j.tcs.2016.09.014_br0080) 2015; 23 Manlove (10.1016/j.tcs.2016.09.014_br0140) 2013 Abraham (10.1016/j.tcs.2016.09.014_br0030) 2006; vol. 3879 Roth (10.1016/j.tcs.2016.09.014_br0190) 1990; vol. 18 Abdulkadiroǧlu (10.1016/j.tcs.2016.09.014_br0020) 2005; 95 Irving (10.1016/j.tcs.2016.09.014_br0130) 2008; 156 Ronn (10.1016/j.tcs.2016.09.014_br0160) 1990; 11 Van Dooren (10.1016/j.tcs.2016.09.014_br0090) 2003; 6 Roth (10.1016/j.tcs.2016.09.014_br0180) 2008; 36 Berman (10.1016/j.tcs.2016.09.014_br0050) 2003 Irving (10.1016/j.tcs.2016.09.014_br0120) 1998; vol. 1461 Gale (10.1016/j.tcs.2016.09.014_br0100) 1962; 69 Biró (10.1016/j.tcs.2016.09.014_br0060) 2010; 411 Hawkes (10.1016/j.tcs.2016.09.014_br0110) 2006
References_xml	– volume: 19 start-page: 279 year: 2010 end-page: 303 ident: br0150 article-title: Keeping partners together: algorithmic results for the hospitals/residents problem with couples publication-title: J. Comb. Optim. – volume: 69 start-page: 9 year: 1962 end-page: 15 ident: br0100 article-title: College admissions and the stability of marriage publication-title: Amer. Math. Monthly – year: 2013 ident: br0140 article-title: Algorithmics of Matching Under Preferences – volume: vol. 18 year: 1990 ident: br0190 article-title: Two-Sided Matching: a Study in Game-Theoretic Modeling and Analysis publication-title: Econom. Soc. Monogr. – volume: 411 start-page: 3136 year: 2010 end-page: 3153 ident: br0060 article-title: The College Admissions problem with lower and common quotas publication-title: Theoret. Comput. Sci. – volume: vol. 1461 start-page: 381 year: 1998 end-page: 392 ident: br0120 article-title: Matching medical students to pairs of hospitals: a new variation on a well-known theme publication-title: Proceedings of ESA '98: the 6th European Symposium on Algorithms – ident: br0210 – volume: 95 start-page: 364 year: 2005 end-page: 367 ident: br0020 article-title: The New York City High School Match publication-title: Am. Econ. Rev. – volume: 11 start-page: 285 year: 1990 end-page: 304 ident: br0160 article-title: NP-complete stable matching problems publication-title: J. Algorithms – volume: 47 start-page: 133 year: 2010 end-page: 180 ident: br0040 article-title: Teachers' mathematical knowledge, cognitive activation in the classroom, and student progress publication-title: Am. Educ. Res. J. – volume: 16 year: 2011 ident: br0070 article-title: Stable matching with couples: an empirical study publication-title: ACM J. Exp. Algorithmics – volume: 156 start-page: 2959 year: 2008 end-page: 2977 ident: br0130 article-title: The stable marriage problem with master preference lists publication-title: Discrete Appl. Math. – volume: vol. 3879 start-page: 1 year: 2006 end-page: 14 ident: br0030 article-title: “Almost stable” matchings in the Roommates problem publication-title: Proceedings of WAOA '05: the 3rd Workshop on Approximation and Online Algorithms – year: 2003 ident: br0050 article-title: Approximation hardness of short symmetric instances of MAX-3SAT – volume: 6 start-page: 27 year: 2003 end-page: 52 ident: br0090 article-title: Pre-service teachers' preferred strategies for solving arithmetic and algebra word problems publication-title: J. Math. Teach. Educ. – year: 4 March 2006 ident: br0110 article-title: Online selection of new doctors grossly unfair – volume: 92 start-page: 991 year: 1984 end-page: 1016 ident: br0170 article-title: The evolution of the labor market for medical interns and residents: a case study in game theory publication-title: J. Polit. Econ. – volume: 23 start-page: 547 year: 2015 end-page: 562 ident: br0080 article-title: Modelling practical placement of trainee teachers to schools publication-title: Cent. Eur. J. Oper. Res. – volume: 36 start-page: 537 year: 2008 end-page: 569 ident: br0180 article-title: Deferred acceptance algorithms: history, theory, practice, and open questions publication-title: Internat. J. Game Theory – volume: 95 start-page: 368 year: 2005 end-page: 371 ident: br0010 article-title: The Boston Public School Match publication-title: Am. Econ. Rev. – year: 2005 ident: br0200 article-title: Casamentos Estáveis e Algoritmos de Colocação de Professores – volume: 411 start-page: 3136 year: 2010 ident: 10.1016/j.tcs.2016.09.014_br0060 article-title: The College Admissions problem with lower and common quotas publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2010.05.005 – volume: 95 start-page: 364 issue: 2 year: 2005 ident: 10.1016/j.tcs.2016.09.014_br0020 article-title: The New York City High School Match publication-title: Am. Econ. Rev. doi: 10.1257/000282805774670167 – volume: 16 year: 2011 ident: 10.1016/j.tcs.2016.09.014_br0070 article-title: Stable matching with couples: an empirical study publication-title: ACM J. Exp. Algorithmics doi: 10.1145/1963190.1970372 – volume: 92 start-page: 991 issue: 6 year: 1984 ident: 10.1016/j.tcs.2016.09.014_br0170 article-title: The evolution of the labor market for medical interns and residents: a case study in game theory publication-title: J. Polit. Econ. doi: 10.1086/261272 – volume: 36 start-page: 537 issue: 3–4 year: 2008 ident: 10.1016/j.tcs.2016.09.014_br0180 article-title: Deferred acceptance algorithms: history, theory, practice, and open questions publication-title: Internat. J. Game Theory doi: 10.1007/s00182-008-0117-6 – volume: 47 start-page: 133 issue: 1 year: 2010 ident: 10.1016/j.tcs.2016.09.014_br0040 article-title: Teachers' mathematical knowledge, cognitive activation in the classroom, and student progress publication-title: Am. Educ. Res. J. doi: 10.3102/0002831209345157 – volume: 11 start-page: 285 year: 1990 ident: 10.1016/j.tcs.2016.09.014_br0160 article-title: NP-complete stable matching problems publication-title: J. Algorithms doi: 10.1016/0196-6774(90)90007-2 – volume: 23 start-page: 547 issue: 3 year: 2015 ident: 10.1016/j.tcs.2016.09.014_br0080 article-title: Modelling practical placement of trainee teachers to schools publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-014-0356-5 – volume: 156 start-page: 2959 issue: 15 year: 2008 ident: 10.1016/j.tcs.2016.09.014_br0130 article-title: The stable marriage problem with master preference lists publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2008.01.002 – year: 2013 ident: 10.1016/j.tcs.2016.09.014_br0140 – year: 2005 ident: 10.1016/j.tcs.2016.09.014_br0200 – volume: vol. 18 year: 1990 ident: 10.1016/j.tcs.2016.09.014_br0190 article-title: Two-Sided Matching: a Study in Game-Theoretic Modeling and Analysis – year: 2003 ident: 10.1016/j.tcs.2016.09.014_br0050 – year: 2006 ident: 10.1016/j.tcs.2016.09.014_br0110 – volume: 19 start-page: 279 issue: 3 year: 2010 ident: 10.1016/j.tcs.2016.09.014_br0150 article-title: Keeping partners together: algorithmic results for the hospitals/residents problem with couples publication-title: J. Comb. Optim. doi: 10.1007/s10878-009-9257-2 – volume: vol. 1461 start-page: 381 year: 1998 ident: 10.1016/j.tcs.2016.09.014_br0120 article-title: Matching medical students to pairs of hospitals: a new variation on a well-known theme – volume: vol. 3879 start-page: 1 year: 2006 ident: 10.1016/j.tcs.2016.09.014_br0030 article-title: “Almost stable” matchings in the Roommates problem – volume: 69 start-page: 9 year: 1962 ident: 10.1016/j.tcs.2016.09.014_br0100 article-title: College admissions and the stability of marriage publication-title: Amer. Math. Monthly doi: 10.2307/2312726 – volume: 95 start-page: 368 issue: 2 year: 2005 ident: 10.1016/j.tcs.2016.09.014_br0010 article-title: The Boston Public School Match publication-title: Am. Econ. Rev. doi: 10.1257/000282805774669637 – volume: 6 start-page: 27 issue: 1 year: 2003 ident: 10.1016/j.tcs.2016.09.014_br0090 article-title: Pre-service teachers' preferred strategies for solving arithmetic and algebra word problems publication-title: J. Math. Teach. Educ. doi: 10.1023/A:1022109006658
SSID	ssj0000576
Score	2.230666
Snippet	Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	15
SubjectTerms	Computer simulation Education Inapproximability Incentives Lists Markets Matching NP-completeness Polynomial-time algorithm Serial dictatorship Stability Stable matchings Teachers
Title	Stable matchings of teachers to schools
URI	https://dx.doi.org/10.1016/j.tcs.2016.09.014 https://www.proquest.com/docview/1855367892
Volume	653
WOSCitedRecordID	wos000387627500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: ScienceDirect customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fa9swEBah3cP2sB_dxrqtxYPBYMXBsmzLeuy6lnXQMlgGeROyLNOUYJfYDfnzd_JJTkhZ6QZ7MY6RFaE7nz7p7rsj5GPFYlpWtAiZgUuieByKKqFhVgBcSCgYS1H0xSb45WU-nYofo9HKc2GWc17X-Wolbv6rqOEZCNtSZ_9C3EOn8ADuQehwBbHD9UGCB_ho2VCARDXW5LRRAJi3uc_m0PZ5N9tNVDrZYDNqV-bhyK2Ng5PC6Kt571ani2aJNy4cQ6G7_WutNrRh5pg0E9C4vvEA3i9UbQNHh4j6o7Px-nTwy2KGiYDPlcsJ7o4kaGa5eUjKxHOyO1wZ5GdZH4zAOiljg-Y25yKMYyxz7O1xlrINi-r6xbUZOdJ3rD4eQFyPO20TsNOsz1yL3NStZNo_7SjsIACGRmlkSeG7MU8F2MPd4_PT6ff1Kp5y9HO7UXuPeB8buPVHf8I0W6t7D1kmz8lTt9cIjlFHXpCRqffIM1_HI3BmfY88uRhy97YvySdUoGBQoKCpAq9AQdcEToFekV9np5OTb6ErpxFqxlkXmgL2AmmiwejGRSoiUQD6LYUpE8OLKleiZCYrRVWWWsG-tdLwU2tA3IJFBeBc9prs1E1t3pBAZwgmo0qwJKNaGGjKocssZ1RF8T6J_IRI7XLN25Inc-mDCq8lzKG0cygjIWEO98nn4ZUbTLRyX-PEz7J0XwMiQAkqcd9rH7xEJFhR6xpTtWluWwmoNWWA20T89t-6fkcer7-E92SnW9yaA_JIL7tZuzh0yvUbHKiRuQ
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Stable+matchings+of+teachers+to+schools&rft.jtitle=Theoretical+computer+science&rft.au=Cechl%C3%A1rov%C3%A1%2C+Katar%C3%ADna&rft.au=Fleiner%2C+Tam%C3%A1s&rft.au=Manlove%2C+David+F.&rft.au=McBride%2C+Iain&rft.date=2016-11-15&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=653&rft.spage=15&rft.epage=25&rft_id=info:doi/10.1016%2Fj.tcs.2016.09.014&rft.externalDocID=S0304397516305011
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon