The Student-Project Allocation Problem

We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this context we seek a stable matching of students to projects, which respects these preference and capacity constraints. Here, the stability definition generalises the corresponding notion in the context of the classical Hospitals / Residents problem. We show that stable matchings can have different sizes, and the problem of finding a maximum cardinality stable matching is NP-hard, though approximable within a factor of 2.

• Type: Conference
• Year: 2003
• Where: ISAAC
• Authors: David J. Abraham, Robert W. Irving, David Manlove
• Keywords: Cardinality Stable Matching, ISAAC 2003, Lecturers, Stable Matching