Abstract
In this paper, we tackle a complex real-world problem: trainee allocation for primary school teachers in a French teaching Academy. This complex real-world problem can be reduced into the well-known Hospitals / Residents (HR) problem. However, the most difficult part consists of generating the preference lists according to the real constraints, priorities and wishes. Additionally, we adapt the \(\mathbb S wing\) method to the HR problem and we apply it to this real-world problem in order to balance the different objectives. In this way, the \(\mathbb S wing\) method decreases the management cost of the operation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Roth, A., Peranson, E.: The redesign of the matching market for american physicians: Some engineering aspects of economic design. AER 89(4), 748–780 (1999)
Baiou, M., Balinski, M.: Admissions and recruitment. AMM 110(5), 386–399 (2003)
Zhang, H.: Analysis of the Chinese college admission system. PhD thesis, University of Edinburgh (2009)
Kennes, J., Monte, D., Tumennasan, N.: The daycare assignment problem. Technical report, Department if Economics and Business, Aarhus University (2011)
Joshi, K., Kumar, S.: Matchmaking using fuzzy analytical hierarchy process, compatibility measure and stable matching for online matrimony in india. Journal of MCDA 19, 57–66 (2012)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. AMM 69, 9–14 (1962)
Knuth, D.: Mariage stables. Les Presses de l’Université de Montréal (1971)
Everaere, P., Picard, G., Morge, M.: Minimal concession strategy for reaching fair, optimal and stable marriages (extended abstract). In: Proc. of AAMAS, pp. 1319–1320 (2013)
Rosenschein, J., Zlotkin, G.: Rules of encounter: designing conventions for automated negotiation among Computers. MIT press (1994)
Gelain, M., Pini, M., Rossi, F., Venable, K., Walsh, T.: Local search algorithms on the stable marriage problem: Experimental studies. In: Proc. of ECAI, pp. 1085–1086 (2010)
Brito, I., Meseguer, P.: Distributed stable matching problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 152–166. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Morge, M., Piette, E. (2014). Practical Application of Matchmaking Problem: Trainee Allocation for Teachers. In: Demazeau, Y., Zambonelli, F., Corchado, J.M., Bajo, J. (eds) Advances in Practical Applications of Heterogeneous Multi-Agent Systems. The PAAMS Collection. PAAMS 2014. Lecture Notes in Computer Science(), vol 8473. Springer, Cham. https://doi.org/10.1007/978-3-319-07551-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-07551-8_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07550-1
Online ISBN: 978-3-319-07551-8
eBook Packages: Computer ScienceComputer Science (R0)