论文标题
尊重优先事项与尊重学校选择的偏好：什么时候进行权衡？
Respecting priorities versus respecting preferences in school choice: When is there a trade-off?
论文作者
论文摘要
该学区在决定使用哪种匹配算法时面临的经典权衡是，不可能始终尊重优先事项和偏好。学生提供的递延接受算法（DA）尊重优先级，但可能导致分配效率低下。我们确定了DA有效的学校选择市场的新条件。我们的条件通过对偏好和优先级的限制仅在与分配相关的零件上相互关系来概括较早的条件。每当有尊重优先级的唯一分配时，我们的条件就会捕获DA有效的所有环境。我们通过风格化的示例和模拟显示，我们的病情大大扩展了DA有效的已知环境范围。我们还讨论了我们的状况如何阐明现有的经验发现。
A classic trade-off that school districts face when deciding which matching algorithm to use is that it is not possible to always respect both priorities and preferences. The student-proposing deferred acceptance algorithm (DA) respects priorities but can lead to inefficient allocations. We identify a new condition on school choice markets under which DA is efficient. Our condition generalizes earlier conditions by placing restrictions on how preferences and priorities relate to one another only on the parts that are relevant for the assignment. Whenever there is a unique allocation that respects priorities, our condition captures all the environments for which DA is efficient. We show through stylized examples and simulations that our condition significantly expands the range of known environments for which DA is efficient. We also discuss how our condition sheds light on existing empirical findings.
