Finding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over Projects
Authors: Hoang Huu Viet, Le Van Tan, Son Thanh Cao
Communications in Computer and Information
: 1306 : 411-422
Publishing year: 11/2020
This paper proposes an efficient algorithm to find a maximum weakly stable matching for the Student-Project Allocation Problem with Preferences over Projects.
Student-Project Allocation Problem, Matching problem, Stable matching, Blocking pair, Local search