对《打破平局的问题:提高择校效率》的电子评论
E-comment on 'What's the Matter with Tie-Breaking: Improving Efficiency in School Choice'
AI总结:
指出Erdil & Ergin (2008)代码中导致不稳定匹配的微小错误,提供修正实现,并报告修正后改进学生比例略低但平均排名提升更大的结果。
摘要:
Erdil & Ergin (2008, AER) 中用于计算稳定改进循环的代码有时会产生不稳定的匹配。我识别出导致该问题的代码中的微小错误,并提出了修正后的实现。虽然 Erdil & Ergin (2008) 计算实验的一般见解仍然成立,但实际改进学生的比例略低于报告值,而他们的平均排名提升则大于报告值。Erdil & Ergin (2008) 中的所有理论发现均未受影响。
英文摘要:
The code that was used in Erdil & Ergin (2008, AER) to compute stable improvement cycles sometimes generated unstable matchings. I identify the minor bug in their code that caused this issue, and I present a corrected implementation. While the general insights from the computational experiments obtained by Erdil & Ergin (2008) persist, the true fraction of improving students is slightly smaller than reported, while their average improvement in rank is larger than reported. All theoretical findings in Erdil & Ergin (2008) are unaffected.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。