Finding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over Projects

This paper proposes an efficient algorithm to find a maximum weakly stable matching for the Student-Project Allocation Problem with Preferences over Projects. We consider the problem as a constraint satisfaction problem and solve it using a local search approach based on the min-conflicts algorithm. By choosing a student generated by a fixed-increment rule and removing the undominated blocking pair formed by the student, we aim to remove all the blocking pairs formed by the student at each iteration of our algorithm. This allows our algorithm to obtain a solution of the problem as quickly as possible. Experimental results show that our algorithm is efficient in terms of both performance and solution quality for solving the problem.