tie breakers
Mechanisms—often random lottery numbers—used to order students who have the same priority for a school.
As defined in Alvin Roth on Matching Markets
Where it comes up · 1
- Alvin Roth on Matching Markets2 claims
Most important claims · 2 of 2Search all claims for “tie breakers” →
- A deferred acceptance algorithm with children proposing makes it safe to list your true preferences: if you don't get your first choice, your chance of getting your second is the same as if you had listed it first, because the algorithm tentatively holds applications, re-orders them by priority regardless of when they applied, and only finalizes acceptances at the end—removing the strategic penalty for honesty.Alvin Roth on Matching Markets
- Boston's old system tried to give as many families as possible their first choice, using priorities (siblings, proximity, lottery) as tie-breakers when oversubscribed; this made it unsafe to list your true first choice because failing to get it could leave your second choice filled with first-choice applicants—even if you held priority there—so the apparent high rate of families getting 'first choices' masked strategic misreporting.Alvin Roth on Matching Markets