Performance-based Stable Matching using Gale-Shapley Algorithm

Abstract

Performance is something that will be achieved at the institute. Everyone has different abilities in doing a task. Placement of an office position does not always result in satisfactory performance. Giving an assignment to people who are not qualified in their field will cause problems in the future. This problem arises from the inability of the person to overcome and complete the assignment. Position balancing is a terrible thing facing every institution. Many of the criteria that should be assessed for a person can be put in a specific position. Manual calculations will hinder the accuracy of employee placement in the company. The Gale-Shapley algorithm can solve this problem well by the expected criteria in a particular position. This algorithm determines the position of work based on the desire of the institution and the ability of the worker. The interchange between employees will occur if the weight changes. The optimal person will fill each job position in the field of work. Stable Matching will be implemented, and the institution will have qualified employees.

Enhancement Of Gale-Shapley algorithm with imbalanced sets for hiring and job finding applications

“…One of which is a performance-based stable matching for employees. This stable matching using the stable marriage algorithm provided optimal pairing results for the employees [5]- [9].…”