Open AccessMatching Final Year Project Topics with Students using Stable Marriage Model
Author(s) -
Naimah Mohd Hussin,
Ammar Azlan
Publication year - 2018
Publication title -
journal of computing research and innovation
Language(s) - English
Resource type - Journals
ISSN - 2600-8793
DOI - 10.24191/jcrinn.v2i1.27
Subject(s) - supervisor , matching (statistics) , stable marriage problem , outcome (game theory) , computer science , process (computing) , mathematics education , pairing , operations research , psychology , mathematics , mathematical economics , statistics , management , economics , programming language , physics , superconductivity , quantum mechanics
Every semester, a newbatch of final year students needs to find a topic and a supervisor tocomplete their final year project requirement. The problem with the current approach is thatit is based on first come first serve. So, the pairing between student and supervisor is nottheoptimal ones, i.e. some students may not get their preferred topic or supervisor. Plus, it is alsotime consuming for both students and supervisors. The researcher is motivated to solve thislong overdue problem by applying a stable marriage model that is introduced by Gale andShapley hence the name Gale-Shapley Algorithm. To determine the functionality of thisapproach, a system prototype has been constructed and a random dataset is used. The result,60% of the students get their first choice topicswhile the remaining students get their secondor third choice. This is a remarkable outcome considering the time and effort saved comparedto the current process. Therefore, stable marriage model is applicable in solving student-topicpairing.