Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model
Pages 260 - 266
Abstract
The problem that we address here is given n job seekers and n job offers, where each job seeker has ranked all job offers in order of preference given by a suitability function, and vice versa; the goal is to compute the minimum set of skills to be offered to the job seekers, so that a) a global stable marriage between job seekers and potential employers can be reached, and b) the degree of satisfaction for that stable marriage might be maximum. To achieve this goal, we have designed an iterative algorithmic solution that can be solved in polynomial time. Additionally, we illustrate our solution with an use case based on a numerical example.
References
[1]
Buga, A., Freudenthaler, B., Martinez-Gil, J., Nemes, S. T., and Paoletti, A. L. (2017). Management of accurate profile matching using multi-cloud service interaction. In Proceedings of the 19th International Conference on Information Integration and Web-based Applications & Services, iiWAS 2017, Salzburg, Austria, December 4-6, 2017, pages 161--165.
[2]
Cabrera-Diego, L. A., El-Bèze, M., Torres-Moreno, J., and Durette, B. (2019). Ranking résumés automatically using only résumés: A method free of job offers. Expert Syst. Appl., 123:91--107.
[3]
Cabrera-Diego, L. A. and Torres-Moreno, J. (2018). Summtriver: A new trivergent model to evaluate summaries automatically without human references. Data Knowl. Eng., 113:184--197.
[4]
Crawford, V. and Knoer, E. M. (1981). Job matching with heterogeneous firms and workers. Econometrica, 49(2):437--50.
[5]
Dias, V. M. F., da Fonseca, G. D., de Figueiredo, C. M. H., and Szwarcfiter, J. L. (2003). The stable marriage problem with restricted pairs. Theor. Comput. Sci., 306(1-3):391--405.
[6]
Espenakk, E., Knalstad, M. J., and Kofod-Petersen, A. (2019). Lazy learned screening for efficient recruitment. In Case-Based Reasoning Research and Development - 27th International Conference, ICCBR 2019, Otzenhausen, Germany, September 8-12, 2019, Proceedings, pages 64--78.
[7]
Faliagka, E., Iliadis, L. S., Karydis, I., Rigou, M., Sioutas, S., Tsakalidis, A. K., and Tzimas, G. (2014). On-line consistent ranking on e-recruitment: seeking the truth behind a well-formed CV. Artif. Intell. Rev., 42(3):515--528.
[8]
Gale, D. and Shapley, L. S. (1962). College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9--15.
[9]
Guedj, M. (2016a). Levelized taxonomy approach for the job seeking/recruitment problem. In 2016 IEEE Intl Conference on Computational Science and Engineering, CSE 2016, and IEEE Intl Conference on Embedded and Ubiquitous Computing, EUC 2016, and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering, DCABES 2016, Paris, France, August 24-26, 2016, pages 448--451.
[10]
Guedj, M. (2016b). Ranking preferences deduction based on semantic similarity for the stable marriage problem. In 15th IEEE International Conference on Cognitive Informatics & Cognitive Computing, ICCI*CC 2016, Palo Alto, CA, USA, August 22-23, 2016, pages 530--534.
[11]
Gusfield, D. and Irving, R. W. (1989). The Stable marriage problem - structure and algorithms. Foundations of computing series. MIT Press.
[12]
Hatfield, J. W. and Kojima, F. (2010). Substitutes and stability for matching with contracts. J. Economic Theory, 145(5):1704--1723.
[13]
Heidemann, J., Muschter, S., and Rauch, C. (2013). How to increase public e-services usage in governments - A case study of the german federal employment agency. In 21st European Conference on Information Systems, ECIS 2013, Utrecht, The Netherlands, June 5-8, 2013, page 128.
[14]
Iwama, K. and Miyazaki, S. (2008). A survey of the stable marriage problem and its variants. International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008), pages 131--136.
[15]
Khobreh, M., Ansari, F., Fathi, M., Vas, R., Mol, S. T., Berkers, H. A., and Varga, K. (2016). An ontology-based approach for the semantic representation of job knowledge. IEEE Trans. Emerging Topics Comput., 4(3):462--473.
[16]
Lastra-Díaz, J. J., García-Serrano, A., Batet, M., Fernández, M., and Chirigati, F. (2017). HESML: A scalable ontology-based semantic similarity measures library with a set of reproducible experiments and a replication dataset. Inf. Syst., 66:97--118.
[17]
Martinez-Gil, J. (2014). An overview of knowledge management techniques for e-recruitment. JIKM, 13(2).
[18]
Martinez-Gil, J., Paoletti, A. L., Rácz, G., Sali, A., and Schewe, K. (2018). Accurate and efficient profile matching in knowledge bases. Data Knowl. Eng., 117:195--215.
[19]
Martinez-Gil, J., Paoletti, A. L., and Schewe, K. (2016). A smart approach for matching, learning and querying information from the human resources domain. In New Trends in Databases and Information Systems - ADBIS 2016 Short Papers and Workshops, BigDap, DCSA, DC, Prague, Czech Republic, August 28-31, 2016, Proceedings, pages 157--167.
[20]
Paoletti, A. L., Martinez-Gil, J., and Schewe, K. (2015). Extending knowledge-based profile matching in the human resources domain. In Database and Expert Systems Applications - 26th International Conference, DEXA 2015, Valencia, Spain, September 1-4, 2015, Proceedings, Part II, pages 21--35.
[21]
Paoletti, A. L., Martinez-Gil, J., and Schewe, K. (2016). Top-k matching queries for filter-based profile matching in knowledge bases. In Database and Expert Systems Applications - 27th International Conference, DEXA 2016, Porto, Portugal, September 5-8, 2016, Proceedings, Part II, pages 295--302.
[22]
Rácz, G., Sali, A., and Schewe, K. (2016). Semantic matching strategies for job recruitment: A comparison of new and known approaches. In Foundations of Information and Knowledge Systems - 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings, pages 149--168.
[23]
Schönböck, J., Altmann, J., Kapsammer, E., Kimmerstorfer, E., Pröll, B., Retschitzegger, W., and Schwinger, W. (2018). A semantic matchmaking framework for volunteering marketplaces. In Trends and Advances in Information Systems and Technologies - Volume 1 [WorldCIST'18, Naples, Italy, March 27-29, 2018], pages 701--711.
[24]
Shmoys, D. B. and Tardos, É. (1993). An approximation algorithm for the generalized assignment problem. Math. Program., 62:461--474.
[25]
Tinelli, E., Colucci, S., Donini, F. M., Sciascio, E. D., and Giannini, S. (2017). Embedding semantics in human resources management automation via SQL. Appl. Intell., 46(4):952--982.
Index Terms
- Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model
Recommendations
Stable Marriage and Genetic Algorithms: A Fertile Union
We describe a pair of genetic algorithms for solving two stable matching problems. Both stable matching problems we will consider involve a set of applicants for positions and a set of employers. Each applicant and each employer prepares a rank order ...
The stable marriage problem with restricted pairs
A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching. In an instance of the STABLE MARRIAGE problem, each of the n men and n women ...
Stable marriage assignment for unequal sets
AbstractThe theory and algorithms developed by the authors in a previous paper for the stable marriage assignment for equal sets are extended to the case of unequal sets. The main theorem in this paper shows that a person unmarried in one stable marriage ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
December 2019
709 pages
ISBN:9781450371797
DOI:10.1145/3366030
Copyright © 2019 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- JKU: Johannes Kepler Universität Linz
- @WAS: International Organization of Information Integration and Web-based Applications and Services
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 February 2020
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- Austrian Ministry for Transport, Innovation and Technology, the Federal Ministry of Science, Research and Economy, and the Province of Upper Austria
Conference
iiWAS2019
iiWAS2019: The 21st International Conference on Information Integration and Web-based Applications & Services
December 2 - 4, 2019
Munich, Germany
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 132Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in