Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2015 | public
Book Section - Chapter

Accuracy for Sale: Aggregating Data with a Variance Constraint

Abstract

We consider the problem of a data analyst who may purchase an unbiased estimate of some statistic from multiple data providers. From each provider i, the analyst has a choice: she may purchase an estimate from that provider that has variance chosen from a finite menu of options. Each level of variance has a cost associated with it, reported (possibly strategically) by the data provider. The analyst wants to choose the minimum cost set of variance levels, one from each provider, that will let her combine her purchased estimators into an aggregate estimator that has variance at most some fixed desired level. Moreover, she wants to do so in such a way that incentivizes the data providers to truthfully report their costs to the mechanism. We give a dominant strategy truthful solution to this problem that yields an estimator that has optimal expected cost, and violates the variance constraint by at most an additive term that tends to zero as the number of data providers grows large.

Additional Information

© 2015 Association for Computing Machinery. Supported in part by NSF grant CNS-1254169 and the US Israel Binational Science Foundation (grant 2012348). Supported by NSF grant CNS-1254169, US-Israel Binational Science Foundation (grant 2012348), the Charles Lee Powell Foundation, a Google Faculty Research Award and a Microsoft Faculty Fellowship. Supported by NSF grants: CCF-1101389, CNS-1065060, CNS-1253345. Supported by NSF grant CCF-1101389. Supported in part by NSF grant CNS-1254169 and the US Israel Binational Science Foundation (grant 2012348).

Additional details

Created:
August 20, 2023
Modified:
October 20, 2023