1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2011
Iterative Constructions and Private Data Release
Anupam Gupta, Aaron Roth, Jonathan Ullman
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of existi…
cs.GT2009
Auctions with Online Supply
Moshe Babaioff, Liad Blumrosen, Aaron L. Roth
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and…
cs.DS2009★ 1 cited
Differentially Private Combinatorial Optimization
Anupam Gupta, Katrina Ligett, Frank McSherry +2
Consider the following problem: given a metric space, some of whose points are "clients", open a set of at most facilities to minimize the average distance from the clients to…