Two algorithms for the student-project allocation problem

DOI10.1016/j.jda.2006.03.006zbMath1135.68650OpenAlexW2012500540MaRDI QIDQ924544

Robert W. Irving, David F. Manlove, David J. Abraham

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.006

zbMATH Keywords

linear-time algorithmstable matching problempreference listslecturer-optimalstudent-optimal

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Matching models (91B68)

Related Items

Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints ⋮ Popularity in the generalized hospital residents setting ⋮ Win-win match using a genetic algorithm ⋮ Profile-Based Optimal Matchings in the Student/Project Allocation Problem ⋮ Strategyproof mechanism for two-sided matching with resource allocation ⋮ Cutoff stability under distributional constraints with an application to summer internship matching ⋮ An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department ⋮ Matchings with lower quotas: algorithms and complexity ⋮ Improved approximation bounds for the student-project allocation problem with preferences over projects ⋮ Handling preferences in student-project allocation ⋮ Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects ⋮ Stability concepts in matching under distributional constraints ⋮ Designing matching mechanisms under constraints: an approach from discrete convex analysis ⋮ Size Versus Stability in the Marriage Problem ⋮ An assignment problem and its application in education domain: a review and potential path ⋮ Student-project allocation with preferences over projects ⋮ Super-stability in the student-project allocation problem with ties ⋮ A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem ⋮ The hospitals/residents problem with lower quotas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Student-project allocation with preferences over projects
• Some remarks on the stable matching problem
• Hard variants of stable marriage.
• Lower Bounds for the Stable Marriage Problem and Its Variants
• Algorithms and Computation
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage