ARC Colloquium: Jamie Morgenstern – Carnegie Mellon University

Event Details
Contact

denton at cc dot gatech dot edu

Summaries

Summary Sentence: Jamie Morgenstern presents a talk as part of the ARC Colloquium series on Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)

Full Summary: Jamie Morgenstern presents a talk as part of the ARC Colloquium series on Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)

Media
  • Jamie Morgenstern Jamie Morgenstern
    (image/jpeg)

(Refreshments served in Klaus 2222 at 2 pm)

Title: 

Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)

Abstract:

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. 

 

Joint work with Sampath Kannan, Aaron Roth and Zhiwei Steven Wu: SODA 2015.


Related Links

Additional Information

In Campus Calendar
No
Groups

College of Computing, School of Computer Science, ARC

Invited Audience
Undergraduate students, Faculty/Staff, Public, Graduate students
Categories
Seminar/Lecture/Colloquium
Keywords
Algorithm and Randomness Center, ARC, ARC Colloquium, Jamie Morgenstern
Status
  • Created By: Josie Giles
  • Workflow Status: Published
  • Created On: Nov 26, 2014 - 10:42am
  • Last Updated: Apr 13, 2017 - 5:21pm