A growing number of school districts use centralized assignment mechanisms to allocate school seats in a manner that reflects student preferences and school priorities. Many of these assignment schemes use lotteries to ration seats when schools are oversubscribed. The resulting random assignment...

Centralized school assignment algorithms must distinguish between applicants with the same preferences and priorities. This is done with randomly assigned lottery numbers, nonlottery tie-breakers like test scores, or both. The New York City public high school match illustrates the latter, using...

This note points out that the proof of Theorem 1, the main theorem, in Ergin (2002) needs two corrections. We provide two counterexamples to Ergin's (2002) proof and show that the theorem holds as it is by providing an alternative proof.

This note points out that the proof of Theorem 1, the main theorem, in Ergin (2002) needs two corrections. We provide two counterexamples to Ergin's proof, and then, show that the theorem holds as it is by providing an alternative proof

A growing number of school districts use centralized assignment mechanisms to allocate school seats in a manner that reflects student preferences and school priorities. Many of these assignment schemes use lotteries to ration seats when schools are oversubscribed. The resulting random assignment...

Centralized school assignment algorithms must distinguish between applicants with the same preferences and priorities. This is done with randomly assigned lottery numbers, nonlottery tie-breakers like test scores, or both. The New York City public high school match illustrates the latter, using...