论文标题

通过最小的妥协提高递延接受度

Improving the Deferred Acceptance with Minimal Compromise

论文作者

Afacan, Mustafa Oguz, Dur, Umut, Gitmez, A. Arda, Yılmaz, Özgür

论文摘要

在学校选择问题中,学生福利(效率)的动机受到尊重学校优先事项(公平)的担忧。在公平的比赛中,即使是福利(SOSM)的最好的比赛也是效率低下的。此外,学生可以操纵任何改善SOSM福利的机制。首先,我们表征了此类中“最不可行的”机制:单调促进的转型证明可确保通过在真正的偏好下促进其指定的学校来更好地摆脱。其次,我们使用这样一种观念,即如果匹配产生了违反优先级的较小学生并相应地定义最小的不公平性,则匹配的不公平不公平。然后,我们证明效率调整后的递延接受度(EADA)机制在高效和单调促进的转换机制的类别中是最小不公平的。当目标是改善学生对SOSM的福利时,这种表征意味着对学校选择中主要公理的前沿的重要见解。

In school choice problems, the motivation for students' welfare (efficiency) is restrained by concerns to respect schools' priorities (fairness). Among the fair matchings, even the best one in terms of welfare (SOSM) is inefficient. Moreover, any mechanism that improves welfare over the SOSM is manipulable by the students. First, we characterize the "least manipulable" mechanisms in this class: monotonically-promoting transformation proofness ensures that no student is better off by promoting their assigned school under the true preferences. Second, we use the notion that a matching is less unfair if it yields a smaller set of students whose priorities are violated, and define minimal unfairness accordingly. We then show that the Efficiency Adjusted Deferred Acceptance (EADA) mechanism is minimally unfair in the class of efficient and monotonically-promoting transformation proof mechanisms. When the objective is to improve students' welfare over the SOSM, this characterization implies an important insight into the frontier of the main axioms in school choice.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源