Overview
The Boston mechanism—also called the immediate acceptance (IA) or first-preferences-first rule—is a method for assigning students to schools (or applicants to seats) based on submitted rank-ordered preferences and school priorities. It operates in rounds: everyone applies to their first choice; schools accept up to capacity according to priority rules; acceptances are final; rejected students then apply to their next choice, and so on. The mechanism prioritizes early listed choices and never “revisits” earlier rounds. It matters because it was widely used in school choice systems and highlights a central tension in market design between allocative efficiency and incentive properties. The Boston mechanism can deliver many first-choice matches when participants report truthfully, but it is not strategy-proof and can reward sophisticated “gaming,” raising fairness concerns.
Origins and Credit
The mechanism was long used in Boston Public Schools, hence its name, and variants appeared in other districts and centralized admissions. A large redesign effort in the early 2000s, led by economists Atila Abdulkadiroğlu, Parag Pathak, and Alvin Roth, documented strategic issues with the Boston mechanism and helped shift Boston and other districts to alternative mechanisms (notably student-proposing deferred acceptance). This work catalyzed the modern field of market design for school choice.
Core Idea and Mechanics
Inputs:
- Each student submits a strict ranking of schools (preferences).
- Each school has a capacity and a priority order over applicants (e.g., siblings, neighborhood, lottery tie-breaks).
Procedure (immediate acceptance):
- Round 1: All students “apply” to their first-choice school. Each school accepts up to capacity the highest-priority applicants among those who applied in this round; acceptances are final, and these seats are removed from the market. Others are rejected.
- Round 2: Rejected students apply to their second choice. Schools with remaining capacity accept the highest-priority applicants among these new applications; acceptances are final. Others are rejected.
- Continue: The process repeats for third choices, fourth choices, etc., until all students are placed or lists are exhausted.
Two features are critical: (i) acceptances are immediate and final—later, higher-priority applicants cannot displace earlier acceptees; and (ii) ranking a school later genuinely reduces one’s chance of getting it because seats may be filled in earlier rounds.
Key Assumptions and Conditions
- Ordinal preferences: Students can rank schools without using money or side payments.
- Exogenous priorities: Each school’s priority order is given (e.g., sibling at the school, geographic zones, lottery tie-breaks).
- Fixed capacities: Schools have known seat limits.
- No upgrading: Acceptances in earlier rounds cannot be overturned in later rounds.
- Complete information not required, but incentives depend on beliefs: Strategic behavior arises because outcomes depend on what others rank.
Implications
- Not strategy-proof: Strategy-proofness means truth-telling is a best response regardless of others’ reports. The Boston mechanism fails this: listing a highly popular school first can be risky if one’s priority is weak; it can be optimal to “play it safe” by ranking a less popular school first.
- Exposure risk and gaming: Because acceptances are final, a student who gambles and loses in early rounds may find that their safer options filled up, worsening their placement. Families with better information or advising can exploit this, raising equity concerns.
- Instability: An assignment is stable if no student–school pair can block it (a student prefers the school and has higher priority than someone enrolled there). The Boston mechanism can produce unstable outcomes because low-priority students can lock in seats early that higher-priority students would prefer, but cannot later displace.
- Potentially more first choices under truth-telling: If all participants report honestly, the Boston mechanism often yields a high share of first-choice assignments. But strategic misreporting in practice can undo this advantage.
- Policy trade-off: Compared with deferred acceptance (DA), Boston can look attractive on the surface (“more first choices”) but tends to produce worse outcomes for unsophisticated participants and can be less fair.
Example in Practice
Three schools A, B, C each have one seat. Four students s1–s4 have these true preferences and priorities (highest priority listed first for each school):
- Preferences: s1: A ≻ B ≻ C; s2: A ≻ C ≻ B; s3: B ≻ A ≻ C; s4: B ≻ C ≻ A.
- Priorities: A: s3 ≻ s1 ≻ s2 ≻ s4; B: s1 ≻ s3 ≻ s4 ≻ s2; C: lottery order irrelevant here.
Round 1: s1 and s2 apply to A; s3 and s4 apply to B. School A accepts s3 (highest priority among its applicants), B accepts s1 (highest priority among its applicants). s2 and s4 are rejected.
Round 2: s2 applies to C; s4 applies to C. C accepts one student by priority/lottery; the other remains unmatched or goes to Round 3. Note that s2 has higher priority at A than s1, but cannot displace s1 at B or s3 at A—acceptances are final. If s2 had “played it safe” and ranked C first, they might have secured a seat for sure, illustrating the incentive to game rankings under Boston.
A DA mechanism, by contrast, would tentatively hold offers and could end with a stable assignment where higher-priority students end up at schools they prefer relative to lower-priority acceptees, while making truthful reporting a best response.
Limitations and Common Misunderstandings
- “Rank what you truly want” is not safe here: Unlike in strategy-proof mechanisms (e.g., student-proposing DA), ranking a very popular school first can reduce the chance of getting acceptable alternatives under the Boston mechanism.
- First-choice rates can be misleading: High first-choice assignments observed under Boston may reflect strategic suppression of true first choices by risk-averse families, not genuine satisfaction.
- Instability can be costly: Unstable assignments may trigger appeals, administrative burdens, and perceptions of unfairness when lower-priority students secure desirable seats.
- Equity concerns: Access to better information or counseling confers an advantage; naive participants are more likely to list “too ambitiously” and end up worse off.
- Not a panacea for capacity constraints: The mechanism cannot solve fundamental scarcity; it only determines who bears the mismatch risk.
Related Concepts (names only)
Deferred Acceptance (Gale–Shapley); Immediate Acceptance; Stability in Matching; Top Trading Cycles; Strategy-Proofness; Market Design for School Choice.
