学生项目分配问题的3/2-近似算法
A 3/2-approximation algorithm for the Student-Project Allocation problem
摘要:
带讲师偏好的学生-项目分配问题(SPA-S)包含三组代理,即学生、项目和讲师,其中学生对项目有偏好,讲师对学生有偏好。在这种情况下,我们寻求一个稳定的匹配,也就是说,学生的项目分配,这样就没有学生和讲师谁有动机偏离他们的受让人/s。我们研究SPA-ST,SPA-S的扩展,其中学生和讲师的偏好列表不需要严格排序,并可能包含领带。在这种情况下,稳定匹配可以具有不同的大小,并且已知在SPA-ST中找到最大稳定匹配的问题MAX SPA-ST是NP难的。提出了MAX SPA-ST的线性时间3/2-近似算法和MAX SPA-ST的优化求解的可编程(IP)模型。我们比较了近似算法与IP模型实验使用随机生成的数据。我们发现,近似算法的性能很容易超过3/2界,在所有情况下,在92%的最佳范围内构建稳定的匹配,在许多情况下,该百分比要高得多。
英文摘要:
The Student-Project Allocation problem with lecturer preferences over Students (SPA-S) comprises three sets of agents, namely students, projects and lecturers, where students have preferences over projects and lecturers have preferences over students. In this scenario we seek a stable matching, that is, an assignment of students to projects such that there is no student and lecturer who have an incentive to deviate from their assignee/s. We study SPA-ST, the extension of SPA-S in which the preference lists of students and lecturers need not be strictly ordered, and may contain ties. In this scenario, stable matchings may be of different sizes, and it is known that MAX SPA-ST, the problem of finding a maximum stable matching in SPA-ST, is NP-hard. We present a linear-time 3/2-approximation algorithm for MAX SPA-ST and an Integer Programming (IP) model to solve MAX SPA-ST optimally. We compare the approximation algorithm with the IP model experimentally using randomly-generated data. We find that the performance of the approximation algorithm easily surpassed the 3/2 bound, constructing a stable matching within 92% of optimal in all cases, with the percentage being far higher for many instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。