• Medientyp: E-Artikel
  • Titel: The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition
  • Beteiligte: Liao, Guocheng; Su, Yu; Ziani, Juba; Wierman, Adam; Huang, Jianwei
  • Erschienen: Institute for Operations Research and the Management Sciences (INFORMS), 2024
  • Erschienen in: Mathematics of Operations Research
  • Sprache: Englisch
  • DOI: 10.1287/moor.2023.0022
  • ISSN: 0364-765X; 1526-5471
  • Schlagwörter: Management Science and Operations Research ; Computer Science Applications ; General Mathematics
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: <jats:p> Whereas users claim to be concerned about privacy, often they do little to protect their privacy in their online actions. One prominent explanation for this privacy paradox is that, when an individual shares data, it is not just the individual’s privacy that is compromised; the privacy of other individuals with correlated data is also compromised. This information leakage encourages oversharing of data and significantly impacts the incentives of individuals in online platforms. In this paper, we study the design of mechanisms for data acquisition in settings with information leakage and verifiable data. We design an incentive-compatible mechanism that optimizes the worst case trade-off between bias and variance of the estimation subject to a budget constraint, with which the worst case is over the unknown correlation between costs and data. Additionally, we characterize the structure of the optimal mechanism in closed form and study monotonicity and nonmonotonicity properties of the marketplace. </jats:p><jats:p> Funding: This work is supported by the National Natural Science Foundation of China [Grants 62202512 and 62271434], Shenzhen Science and Technology Program [Grant JCYJ20210324120011032], Guangdong Basic and Applied Basic Research Foundation [Grant 2021B1515120008], Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Network [Grant ZDSYS20220606100601002], and the Shenzhen Institute of Artificial Intelligence and Robotics for Society. This work is also supported by the National Science Foundation [Grants CNS-2146814, CPS-2136197, CNS-2106403, and NGSDI-2105648]. </jats:p><jats:p> Supplemental Material: The online appendix is available at https://doi.org/10.1287/moor.2023.0022 . </jats:p>