Handling preferences in student-project allocation

DOI10.1007/s10479-017-2710-1zbMath1434.90221OpenAlexW2770493860MaRDI QIDQ1730741

Marco Chiarandini, Stefano Gualandi, Rolf Fagerberg

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2710-1

zbMATH Keywords

mixed integer linear programmingordered weighted averaginglexicographic optimizationfair assignmentbipartite matching with one-sided preferencesenvy-free divisionprofile-based optimizationstudent-project allocation problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Matching models (91B68)

Related Items

Stable matching of student-groups to dormitories, A set partitioning based goal programming model for the team formation problem, An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department, Super-stability in the student-project allocation problem with ties, Student-project allocation with preferences over projects: algorithmic and experimental results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximation bounds for the student-project allocation problem with preferences over projects
• Two algorithms for the student-project allocation problem
• The college admissions problem with lower and common quotas
• Student-project allocation with preferences over projects
• On the analytic representation of the Leximin ordering and its application to flexible constraint propagation
• Matchings with lower quotas: algorithms and complexity
• Assigning papers to referees
• A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
• A genetic algorithm for the project assignment problem
• Improving Community Cohesion in School Choice via Correlated-Lottery Implementation
• Improving matching under hard distributional constraints
• Algorithmics of Matching Under Preferences
• Matching with sizes (or scheduling with processing set restrictions)
• A new solution to the random assignment problem.