Student-Project Allocation with preferences over Projects

Authors:
David F. Manlove;Gregg O'Malley
Affiliations:
Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK;Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 7
Cited 2

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Approximation algorithms

Approximation algorithms
Approximability results for stable marriage problems with ties

Theoretical Computer Science
A genetic algorithm for the project assignment problem

Computers and Operations Research
Two algorithms for the Student-Project Allocation problem

Journal of Discrete Algorithms
A systematic approach to the implementation of final year projectin an electrical engineering undergraduate course

IEEE Transactions on Education
Student project allocation using integer programming

IEEE Transactions on Education

Improved approximation bounds for the student-project allocation problem with preferences over projects

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, which motivates max-spa-p, the problem of finding maximum cardinality stable matching. We prove that max-spa-p is NP-hard and not approximable within @d, for some @d1, unless P=NP. On the other hand, we give an approximation algorithm with a performance guarantee of 2 for max-spa-p.