论文标题
在座位分配问题上有多个功绩列表
On seat allocation problem with multiple merit lists
论文作者
论文摘要
在本说明中，如果有两个或多个功绩列表，我们为联合座椅分配问题提供了一种更简单的算法。如果有两个列表（印度工程席位的当前情况），该算法的运行时间与两个单独（脱节）分配的运行时间总和成正比。该算法是直截了当的，并且不是（至少直接）基于大风和沙普利的递延接受算法。每个人只能在他或她的偏好清单中移动更高。因此，算法的所有步骤都可以公开。这将提高透明度和对系统的信任。
In this note, we present a simpler algorithm for joint seat allocation problem in case there are two or more merit lists. In case of two lists (the current situation for Engineering seats in India), the running time of the algorithm is proportional to sum of running time for two separate (delinked) allocations. The algorithm is straight forward and natural and is not (at least directly) based on deferred acceptance algorithm of Gale and Shapley. Each person can only move higher in his or her preference list. Thus, all steps of the algorithm can be made public. This will improve transparency and trust in the system.
