The Secure Boston Mechanism: theory and experiments
提出一种混合波士顿机制与延迟接受算法的安全波士顿机制，理论表明其比波士顿机制更防策略且更公平，实验证实能显著提高诚实报告和公平性，模拟显示在帕累托效率上常优于延迟接受算法。
Abstract This paper introduces a new matching mechanism that is a hybrid of the two most common mechanisms in school choice, the Boston Mechanism (BM) and the Deferred Acceptance algorithm (DA). BM is the most commonly used mechanism in the field, but it is neither strategyproof nor fair. DA is the mechanism that is typically favored by economists, but it is not Pareto efficient. The new mechanism, the Secure Boston Mechanism (sBM), is an intuitive modification of BM that secures any school a student was initially guaranteed but otherwise prioritizes a student at a school based upon how she ranks it. Relative to BM, theoretical results suggest that sBM is an improvement in terms of strategyproofness and fairness. We present experimental evidence using a novel experimental design that confirms that sBM significantly increases truth-telling and fairness. Relative to DA, theoretical results suggest that sBM can be a Pareto improvement in equilibrium but the efficiency comparison of sBM and DA is theoretically ambiguous. We present simulation evidence that suggests that sBM often does Pareto dominate DA when DA is inefficient, while sBM and DA very often overlap when DA is efficient. Overall, our results strongly support the use of sBM over BM and suggest that sBM should be considered as a viable alternative to DA.