Public schools cannot auction seats to the highest bidder. Families rank schools, schools have priorities, and a mechanism assigns seats. The old Boston system quietly punished families who ranked honestly. Deferred acceptance fixed that.
School choice and design without money
Many important markets forbid prices: school seats, organ transplants, cadet postings. Deferred acceptance carries over from the marriage market to school choice, where it gives stable assignments and makes honest ranking a dominant strategy for families. This lesson stays with ordinary school choice; matching with wages, schedules, or other contract terms requires an extended model.
Deferred acceptance produces a matching with no...
A mechanism is strategy-proof if telling the truth is...
Predict, then play
Three students, three schools with one seat each. Students have preferences; schools have priority orders. Run student-proposing deferred acceptance.
Why did that happen?
Take a guess, then reveal the reason
Two students want school A, but A has one seat and a priority order, so it keeps the higher-priority student and rejects the other, who then tries their next choice. That rejection cascades: the displaced student bumps someone at the next school, and so on, until everyone is placed with no lingering blocking pair. Because a student never loses a seat by aiming high first, listing schools in true order is always safe. The Boston mechanism lacked this property, so families had to strategize about where to rank popular schools.
The math
Treat students as proposers and school priority orders as the receiving sideβs preferences. Student-proposing deferred acceptance yields a stable assignment (no student-school pair both prefer each other to their assignment) and is strategy-proof for students: truthful ranking is a dominant strategy. If agreements also specify wages, schedules, or other terms, each partner-term pair is a contract. Stability and cumulative-offer results in that richer setting require substitutable choice functions, which the school-seat game here does not model.
Run student-proposing DA. Round 1: , , . School holds its higher priority and rejects . Round 2: ; prefers to its current , so it swaps, rejecting . Round 3: , rejected (A keeps ). Round 4: , accepted. Final: , , , a stable assignment.
Contrast with TTC, which would maximize efficiency but can violate priorities. School districts that value respecting priorities (stability) choose DA; the choice between DA and TTC is a real design trade-off, not a matter of one dominating the other.
Work it out
Trace the rejection chain
Students propose to their top schools: and both go to , and goes to . School ranks , so it tentatively holds and rejects .
now proposes to its second choice, , which already holds . Since ranks , it swaps to and rejects . Displaced, proposes to , which keeps and rejects it; then proposes to , which accepts. The chain settles at , , . Every student ranked honestly, and none could have done better by lying, which is exactly the property the old Boston mechanism lacked.
Key idea
Student-proposing deferred acceptance gives a stable school assignment and makes truthful ranking a dominant strategy for students. Adding contract terms requires extra assumptions and a richer cumulative-offer model.
Check yourself
Sources
- Hatfield, J. W., and Milgrom, P. R. (2005). Matching with contracts. American Economic Review, 95(4), 913-935.
- AbdulkadiroΔlu, A., and SΓΆnmez, T. (2003). School choice: a mechanism design approach. American Economic Review, 93(3), 729-747.