Handling preferences in student-project allocation
Handling preferences in student-project allocation
复制标题
处理学生项目分配中的偏好
DOI：
10.1007/s10479-017-2710-1
复制
发表时间：
2017
影响因子：
4.8
通讯作者：
Stefano Gualandi
中科院分区：
文献类型：
--
作者：
Marco Chiarandini;Rolf Fagerberg;Stefano Gualandi
我们考虑的问题，分配学生的项目主题满足侧约束，并考虑到学生的喜好。学生根据他们对主题的偏好对项目进行排名，并且边约束限制了学生在项目主题中组队的可能性。我们的目标是找到公平的任务，并最大限度地提高集体满意度。此外，我们从学生的角度考虑稳定性和嫉妒的问题。这个问题出现作为一个关键的活动，在南丹麦大学科学系的第一年课程的组织。我们正式的学生项目分配问题作为一个混合整数线性规划问题，并专注于不同的方式来模拟公平和功利的原则。在真实数据的基础上，我们根据经验比较了不同模型的分配质量和通过最先进的商业求解器找到解决方案的计算工作量。我们提供的经验证据，这些模型对学生作业的分布，这可能是有价值的输入，在类似的设置政策制定者的影响。在这些结果的基础上，我们提出了新的模型组合，对于我们的情况，在一分钟的计算内获得可行的，稳定的，公平的和集体满意的解决方案。自2010年以来，这些解决方案在我们机构的实践中使用。
We consider the problem of allocating students to project topics satisfying side constraints and taking into account students’ preferences. Students rank projects according to their preferences for the topic and side constraints limit the possibilities to team up students in the project topics. The goal is to find assignments that are fair and that maximize the collective satisfaction. Moreover, we consider issues of stability and envy from the students’ viewpoint. This problem arises as a crucial activity in the organization of a first year course at the Faculty of Science of the University of Southern Denmark. We formalize the student-project allocation problem as a mixed integer linear programming problem and focus on different ways to model fairness and utilitarian principles. On the basis of real-world data, we compare empirically the quality of the allocations found by the different models and the computational effort to find solutions by means of a state-of-the-art commercial solver. We provide empirical evidence about the effects of these models on the distribution of the student assignments, which could be valuable input for policy makers in similar settings. Building on these results we propose novel combinations of the models that, for our case, attain feasible, stable, fair and collectively satisfactory solutions within a minute of computation. Since 2010, these solutions are used in practice at our institution.
较低配额的匹配：算法和复杂性
影响因子：
1.1
作者：
Arulselvan A
通讯作者：
Arulselvan A
DOI：
10.1016/j.dam.2011.11.003
发表时间：
2014-02
期刊：
Electron. Notes Discret. Math.
影响因子：
--
作者：
P. Biró;Eric McDermid
通讯作者：
P. Biró;Eric McDermid