Analysis and GUI Implementation of Stable Marriage Algorithm for Student Project Allocation

Aiming at the problem of number of students and available projects with the teachers, the student-project allocation (SPA) problem emerges. In this paper, we address SPA problem by using stable marriage algorithm (SMA) based on Gale Shapley algorithm. We consider list of choices from students and teachers, which are our participants in SPA. The SMA then uses the preference list to find stable matches among the participants. The stable matches will be found when the algorithm terminates. Furthermore, we use graphical user interface (GUI) connected to SQLite database to maintain the preference list of participants. In the subsequent stages of implementation, we use the database maintained through the GUI. The online storage of preference list avoids data loss and make it easy to use when number of participants increases. It is a sophisticated way to access and modify database when required. Combining the SMA and GUI we address SPA challenges and it can also be used to solve problems in relatable contexts where stable matches are required to be allocated