Approximately Stable, School Optimal, and Student-Truthful Many-to-One   Matchings (via Differential Privacy)
  We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this endeavor is differential privacy: we give an algorithm that coordinates a stable matching using differentially private signals, which lead to our truthfulness guarantee. This is the first setting in which it is known how to achieve nontrivial truthfulness guarantees for students when computing school optimal matchings, assuming worst- case preferences (for schools and students) in large markets. 
Sampath Kannan, Jamie Morgenstern, Aaron Roth, Zhiwei Steven Wu
cs.GT