A number of labor markets and student placement systems can be modeled as many-to-one matching markets. We analyze the scope for manipulation in many-to-one matching markets under the student-optimal stable mechanism when the number of participants is large. Under some regularity conditions, we show that the fraction of participants with incentives to misrepresent their preferences when others are truthful approaches zero as the market becomes large. With an additional condition, truthful reporting by every participant is an approximate equilibrium under the student-optimal stable mechanism in large markets. (JEL C78)

The design of the New York City (NYC) high school match involved trade-offs among efficiency, stability, and strategy-proofness that raise new theoretical questions. We analyze a model with indifferences—ties—in school preferences. Simulations with field data and the theory favor breaking indifferences the same way at every school—single tiebreaking—in a student-proposing deferred acceptance mechanism. Any inefficiency associated with a realized tiebreaking cannot be removed without harming student incentives. Finally, we empirically document the extent of potential efficiency loss associated with strategy-proofness and stability, and direct attention to some open questions. (JEL C78, D82, I21)