Stable matchings of teachers to schools
From MaRDI portal
Publication:329714
DOI10.1016/j.tcs.2016.09.014zbMath1353.91029arXiv1501.05547OpenAlexW2964211258MaRDI QIDQ329714
Tamás Fleiner, Iain McBride, David F. Manlove, Katarína Cechlárova
Publication date: 21 October 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05547
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Modelling practical placement of trainee teachers to schools
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- The college admissions problem with lower and common quotas
- The stable marriage problem with master preference lists
- Deferred acceptance algorithms: history, theory, practice, and open questions
- NP-complete stable matching problems
- Algorithmics of Matching Under Preferences
- Stable matching with couples
- Approximation and Online Algorithms
- College Admissions and the Stability of Marriage