Implementation of Stable Marriage Algorithm in Student Project Allocation

Abstract


 
 
 
 Project allocation is an annual challenge for lecturers and students. The process of allocating project involves matching preferences of students over project and with of staff over the student, and is thus an instance of stable marriage problem from theoretical computer science aspect. The aim is to find a stable allocation of project to students, such that it is impossible to find a project swap that would make all involved parties (both students, both staff) happier. This paper investigated efficacy of stable marriage algorithm and deployed basic Gale Sharply Algorithm into the process of allocating student project. A system was developed using ruby and MySQL to handle the task. The result showed that the algorithm was able to improve the process by enhancing the stability involved. 
 
 
 
 

Optimum Allocation of Graduation Projects: Survey and Proposed Solution

“…Because the model focuses on the level of student satisfaction, the weight of a load of supervising the supervisors may be unfair, and that some supervisors do not have any students to supervise this is one of the problems of this model. [18] In 2018, proposed to use Gale Shapley Stable Marriage Algorithm to Allocation the project to the student depends on matching between two sets of preference lists (student preference over project list and supervisor preference over student list). This algorithm aims to provide a stable matching between two sets.…”

A Survey of Across Social Networks User Identification

“…The matching between the accounts can then be completed by using the relevant matching algorithm. When matching the accounts on the two SNs, a classic matching algorithm can be employed, such as a weighted bipartite graph matching algorithm [32], stable marriage matching [33], etc. Let n be the number of accounts to be matched, the time complexity of the bipartite graph maximum weight matching algorithm is O(n 3 ); By contrast, the time complexity of the stable marriage matching algorithm is O(n 2 ), which is relatively low.…”