Strategic priority-based course allocation
提出条件接受机制解决优先级下的课程分配问题，该机制在偏好和优先级可替代时实现稳定分配，并设计重复版本来减少非均衡导致的效率损失。
We introduce the conditional acceptance mechanism for solving the course allocation problem under priorities. This mechanism implements the set of stable allocations in both Nash equilibrium and undominated Nash equilibrium when preferences and priorities are substitutable. We model a post-allocation adjustment mechanism using a repeated version of the conditional acceptance mechanism that mitigates the inefficiencies caused by deviating from equilibrium. Both mechanisms are straightforward to implement, simplify the elicitation of students’ preferences, and share features with currently employed course allocation mechanisms.