Combinatorial Optimization Reading Group - Harry Sivasubramaniam

Title:

Abstract:

Differential privacy is about preserving an individuals privacy while maintaining utility in the context of data analysis. In this talk we will take a look at some classic combinatorial optimization problems such as min-cut and k-median through the lens of differential privacy. This is work from 2009 by Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth and Kunal Talwar. I will discuss some of their results and further work.