先决条件下学生与课程的帕累托最优匹配
Pareto optimal matchings of students to courses in the presence of prerequisites
摘要:
我们考虑的问题分配申请人的课程,每个申请人都有一个子集,她在严格的优先顺序排列可接受的课程。每个申请人和课程都有一个容量,分别表示可以分配给他们的课程和申请人的最大数量。因此,我们基本上有一个多对多的双边匹配问题,片面的偏好,这有应用程序的学生在大学选修课的分配。我们认为添加剂的偏好和词典的偏好作为两种手段扩展的偏好,在个别课程的偏好捆绑课程。我们还专注于课程有先决条件的限制,课程可能是cooperative的情况。对于这些扩展的基本问题,我们提出了以下算法的结果,这主要是有关的计算帕累托最优匹配(POM)。首先,我们考虑强制性的先决条件。对于添加剂的偏好,我们发现,找到一个POM的问题是NP难的。另一方面,在字典式偏好的情况下,我们给出了一个多项式时间的算法来找到一个POM,基于众所周知的顺序机制。然而,我们表明,决定一个给定的匹配是否是帕累托最优的问题是合作NP-完全的。我们进一步证明,找到一个最大的基数(帕累托最优)匹配是NP难的。在其他前提下,我们发现,找到一个POM是NP-难的添加剂或词典的喜好。最后,我们来看看coco。我们证明,在强制性的先决条件的情况下,找到一个POM是NP-难的添加剂的喜好,但在多项式时间可解的字典式偏好。在后一种情况下,找到最大基数POM的问题是NP难的,并且很难近似
英文摘要:
We consider the problem of allocating applicants to courses, where each applicant has a subset of acceptable courses that she ranks in strict order of preference. Each applicant and course has a capacity, indicating the maximum number of courses and applicants they can be assigned to, respectively. We thus essentially have a many-to-many bipartite matching problem with one-sided preferences, which has applications to the assignment of students to optional courses at a university. We consider additive preferences and lexicographic preferences as two means of extending preferences over individual courses to preferences over bundles of courses. We additionally focus on the cases that courses have prerequisite constraints and where courses may be corequisites. For these extensions to the basic problem, we present the following algorithmic results, which are mainly concerned with the computation of Pareto optimal matchings (POMs). Firstly, we consider compulsory prerequisites. For additive preferences, we show that the problem of finding a POM is NP-hard. On the other hand, in the case of lexicographic preferences we give a polynomial-time algorithm for finding a POM, based on the well-known sequential mechanism. However we show that the problem of deciding whether a given matching is Pareto optimal is co-NP-complete. We further prove that finding a maximum cardinality (Pareto optimal) matching is NP-hard. Under alternative prerequisites, we show that finding a POM is NP-hard for either additive or lexicographic preferences. Finally we consider corequisites. We prove that, as in the case of compulsory prerequisites, finding a POM is NP-hard for additive preferences, though solvable in polynomial time for lexicographic preferences. In the latter case, the problem of finding a maximum cardinality POM is NP-hard and very difficult to approximate
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。