arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.07982cs.DS
收藏

解决选课难题的算法方法

An Algorithmic Approach to Address Course Enrollment Challenges

Harvard University(哈佛大学);Northwestern University(西北大学)

Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu

AI总结:

本文提出了一种算法方法,用于解决课程注册中的公平性和高效用问题,考虑了总效用、最大最小和公平性等目标函数。

摘要:

计算机科学系中课程注册量的激增导致了严重的危机-不仅某些课程的需求极高,非专业学生的需求也极为突出。很多时候,这导致学生感到极大的沮丧,获得理想课程的名额往往是一个相当随意的过程。一种方法是首先从学生处收集他们想选的课程信息,并开发优化模型来公平地分配学生到可用的座位。使这个问题复杂的是,课程本身有时间冲突,而学生有学分上限(一个上限,限制他们想注册的课程数量)。我们将其建模如下。我们有n个代理(学生),还有

英文摘要:

Massive surges of enrollments in courses have led to a crisis in several computer science departments - not only is the demand for certain courses extremely high from majors, but the demand from non-majors is also very high. Much of the time, this leads to significant frustration on the part of the students, and getting seats in desired courses is a rather ad-hoc process. One approach is to first collect information from students about which courses they want to take and to develop optimization models for assigning students to available seats in a fair manner. What makes this problem complex is that the courses themselves have time conflicts, and the students have credit caps (an upper bound on the number of courses they would like to enroll in). We model this problem as follows. We have $n$ agents (students), and there are "resources" (these correspond to courses). Each agent is only interested in a subset of the resources (courses of interest), and each resource can only be assigned to a bounded number of agents (available seats). In addition, each resource corresponds to an interval of time, and the objective is to assign non-overlapping resources to agents so as to produce "fair and high utility" schedules. In this model, we provide a number of results under various settings and objective functions. Specifically, in this paper, we consider the following objective functions: total utility, max-min (Santa Claus objective), and envy-freeness. The total utility objective function maximizes the sum of the utilities of all courses assigned to students. The max-min objective maximizes the minimum utility obtained by any student. Finally, envy-freeness ensures that no student envies another student's allocation. Under these settings and objective functions, we show a number of theoretical results. Specifically, we show that the course allocation under [...]

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑