Handling preferences in student-project allocation
type: Item
instance of: scholarly article
title: Handling preferences in student-project allocation
zbMATH Open document ID: 1434.90221
author: Marco Chiarandini
author: Rolf Fagerberg
author: Stefano Gualandi
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 7032707
zbMATH Keywords: bipartite matching with one-sided preferences
zbMATH Keywords: student-project allocation problem
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: fair assignment
zbMATH Keywords: lexicographic optimization
zbMATH Keywords: ordered weighted averaging
zbMATH Keywords: profile-based optimization
zbMATH Keywords: envy-free division
MaRDI profile type: Publication
full work available at URL: s10479-017-2710-1
OpenAlex ID: W2770493860
cites work: Two algorithms for the student-project allocation problem
cites work: Matchings with lower quotas: algorithms and complexity
cites work: Improving Community Cohesion in School Choice via Correlated-Lottery Implementation
cites work: The college admissions problem with lower and common quotas
cites work: Matching with sizes (or scheduling with processing set restrictions)
cites work: A new solution to the random assignment problem.
cites work: Q3624140
cites work: Q4338900
cites work: Improving matching under hard distributional constraints
cites work: Assigning papers to referees
cites work: Q3995616
cites work: A genetic algorithm for the project assignment problem
cites work: Improved approximation bounds for the student-project allocation problem with preferences over projects
cites work: Algorithmics of Matching Under Preferences
cites work: Student-project allocation with preferences over projects
cites work: A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
cites work: Q4649021
cites work: On the analytic representation of the Leximin ordering and its application to flexible constraint propagation
DOI: 10.1007/S10479-017-2710-1
description: scientific article; zbMATH DE number 7032707