少点错误 03月04日
Middle School Choice
index_new5.html
../../../zaker_core/zaker_tpl_static/wap/tpl_guoji1.html

 

文章探讨了某城市小学毕业生升入初中的学校选择过程,该过程允许家长对学校进行优先级排序。然而,作者指出,现行系统存在一个问题,即鼓励家长进行策略性选择,而非真实偏好,从而可能导致不公平的结果。文章分析了在现有规则下,家长如何根据学校的招生名额、兄弟姐妹优先权和地理位置优先权等因素来优化选择策略。作者建议采用Gale-Shapley算法,类似于医学院住院医师匹配系统,以消除策略性选择的必要性,并提高学生进入首选学校的机会。

🏫 现行学校选择系统鼓励家长进行策略性选择,而非表达真实偏好。家长需要考虑学校的招生名额、兄弟姐妹优先权和地理位置优先权等因素,以最大化被理想学校录取的机会。

📍 地理位置优先权是影响学校选择的重要因素。每个家庭都有一个指定的地理位置优先学校,在该学校的录取中享有优先权。但由于某些学校的地理位置优先学生数量超过可用名额,因此将地理位置优先学校列为第一选择并不一定能保证录取。

⚖️ 作者建议采用Gale-Shapley算法来优化学校选择系统。该算法要求学生列出所有学校的偏好顺序,并进行多轮匹配,直至所有学生都被分配到一所学校。该算法消除了策略性选择的必要性,使学生能够更真实地表达自己的偏好。

Published on March 3, 2025 4:10 PM GMT

Our oldest is finishing up 5th grade, at the only school in our citythat doesn't continue past 5th. The 39 5th graders will be split upamong six schools, and we recently went though the process ofindicating our preferences and seeing where we ended up. The processisn't terrible, but it could be modified to stop giving an advantageto parents who carefully game it out while better matching kids topreferred schools.

First, what is the current process? You put in 1st, 2nd, and 3rdchoice rankings, which are interpreted in three rounds. Kids areassigned to 1st choice schools, then the ones who didn't get in areassigned among 2nd choices, and finally 3rd choices. Ties are brokenby sibling priority, proximity priority, and then by lottery number.

For sibling priority, if you have a sibling who will be in the schoolnext year you have priority over students who don't. In practice thismeans if you list a sibling priority school as your first choice youget it.

For proximity priority, each family has a proximity school. This maynot be the closest one to their house, and for us it isn't, but its atleast reasonably close. It's the same as siblings: you have priorityover any non-proximity students. Listing your proximity school firstwon't always get you in, since some schools (ex: ours) have many moreproximity students than open spots.

The open spots this year are:

SchoolSiblingProximityAvailable seats
A032
B030
C0310
D21123
E1164
F004

Under the current system, what did it make sense for us to put for ourtop three choices? Ignoring B, which has no available spots, ourpreference order is D > E > A > C > F. We could put thatdown directly (D, E, A) but how do proximity and limited spaces affectour decision?

Our proximity school is E, with 4 available seats. It was very likelythat the family with sibling priority would put it first, so really 3available seats. If we put it first and so did all other familieswith proximity, we'd have a 3/15 chance of getting a spot there. Ithink this means our best chances would be putting first D, then C,and then it doesn't matter much:

For simplicity, lets assume everyone has the same preferences we wouldhave if we lived where they did. That means people prefer whicheveris closest of A, E, or D. Then on the first round, of the 39rising 6th graders:

So our odds of getting D would be somewhere between 10/20 and 10/15.

But the real world looks a bit better than this:

When we put in our preferences I guessed our likely outcomes were 62%D, 35% C, 2% other. Several weeks later we learned that our lotterynumber was 19/39, we got C and were placed first on the waitlist forD. Since there are ~70 rising sixth graders for D I think it's verylikely that at least one of them will move away and we'll get in.

This felt a bit like playing a board game because that's the mainplace I work through rules in a zero-sum context, but here the resultsmatter. I really don't like that us getting a school we preferessentially has to come at the expense of other families getting whatthey'd prefer.

While the zero-sum nature is unavoidable, we could at least rework thesystem to no longer require families to be strategic. This isactually a very well-known problem,and we can apply the Gale–Shapleyalgorithm, which is used in medical residency matching:

Instead of listing just your top three choices, you list all of them.Because there's no benefit to misreportingyour preferences this is relatively easy. Once you haveeveryone's preferences you assign lottery numbers as before, and thenrun multiple rounds of an algorithm.

In the first round, every student "applies" to their top choice. Theschool ranks students by sibling status, then proximity status, thenlottery number, and provisionally accepts students up to capacity. Inthe next round unassigned students "apply" to their next rankedschools, with schools provisionally accepting anyone they rank higherthan their previously provisionally accepted students and bumpingstudents as needed. This continues until everyone has a place, andwhich point provisional acceptances become real acceptances andstudents are notified.

I especially like that with this algorithm families don't need toconsider what other families are likely to do. If they prefer E to D,they can just put E first, without worrying that they are wasting achoice. While as someone who does think through strategy I expectthis change would make our family mildly worse off, a system wherepeople have the best chances of getting into their preferred schoolsif they accurately report their preferences seems clearly betteroverall.



Discuss

Fish AI Reader

Fish AI Reader

AI辅助创作,多种专业模板,深度分析,高质量内容生成。从观点提取到深度思考,FishAI为您提供全方位的创作支持。新版本引入自定义参数,让您的创作更加个性化和精准。

FishAI

FishAI

鱼阅,AI 时代的下一个智能信息助手,助你摆脱信息焦虑

联系邮箱 441953276@qq.com

相关标签

学校选择 Gale-Shapley算法 教育公平
相关文章