9 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.GT2012★ 9 cited
Conducting Truthful Surveys, Cheaply
Aaron Roth, Grant Schoenebeck
We consider the problem of conducting a survey with the goal of obtaining an unbiased estimator of some population statistic when individuals have unknown costs (drawn from a known…
cs.DS2010★ 1 cited
Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms
Anupam Gupta, Aaron Roth, Grant Schoenebeck +1
Constrained submodular maximization problems have long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The ca…
cs.CR2010★ 1 cited
General Hardness Amplification of Predicates and Puzzles
Thomas Holenstein, Grant Schoenebeck
We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the fir…