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

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Guocheng Liao, Yu Su, Juba Ziani, Adam Wierman, Jianwei Huang
{"title":"The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition","authors":"Guocheng Liao, Yu Su, Juba Ziani, Adam Wierman, Jianwei Huang","doi":"10.1287/moor.2023.0022","DOIUrl":null,"url":null,"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 .","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1287/moor.2023.0022","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

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 .
数据采集中的隐私悖论与偏差-方差的最佳权衡
虽然用户声称关注隐私,但他们在网上行为中往往很少保护自己的隐私。对这一隐私悖论的一个重要解释是,当个人分享数据时,不仅个人隐私会受到损害,与之相关数据的其他个人隐私也会受到损害。这种信息泄露会助长数据的过度共享,并严重影响个人在网络平台上的积极性。在本文中,我们研究了在信息泄露和数据可验证的环境下数据获取机制的设计。我们设计了一种与激励相容的机制,在预算约束下优化估计偏差和方差之间的最坏情况权衡,其中最坏情况是成本和数据之间的未知相关性。此外,我们还以封闭形式描述了最优机制的结构,并研究了市场的单调性和非单调性:本研究得到了国家自然科学基金[62202512 和 62271434]、深圳市科技计划[JCYJ20210324120011032]、广东省基础与应用基础研究基金[2021B1515120008]、深圳市众智赋能低碳能源网络重点实验室[ZDSYS20220606100601002]和深圳市人工智能与机器人社会应用研究所的资助。本研究还得到了美国国家科学基金会(National Science Foundation)[资助号:CNS-2146814、CPS-2136197、CNS-2106403 和 NGSDI-2105648]的支持:在线附录见 https://doi.org/10.1287/moor.2023.0022 。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信