The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition

Author:

Liao Guocheng1ORCID,Su Yu2ORCID,Ziani Juba3ORCID,Wierman Adam2ORCID,Huang Jianwei4ORCID

Affiliation:

1. School of Software Engineering, Sun Yat-sen University, Zhuhai 519082, China;

2. Computing and Mathematical Sciences Department, California Institute of Technology, Pasadena, California 91125;

3. Industrial and Systems Engineering Department, Georgia Institute of Technology, Atlanta, Georgia 30332;

4. School of Science and Engineering, Shenzhen Institute of Artificial Intelligence and Robotics for Society, The Chinese University of Hong Kong, Shenzhen, Shenzhen 518172, China

Abstract

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. 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]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/moor.2023.0022 .

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3