{"title":"Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model","authors":"Jorge Martínez Gil, B. Freudenthaler","doi":"10.1145/3366030.3366063","DOIUrl":null,"url":null,"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.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3366030.3366063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.