Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yu Su 0013

dblp:38/1070-13 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-7159-4542ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Usable security · 50% Privacy and data protection · 50%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
information leakage
0.512021
The Privacy Paradox and Optimal Bias-Variance Trade-offs in Data Acquisition · EC 2021
Usable security › usable privacy › privacy behavior
privacy paradox
0.512021
The Privacy Paradox and Optimal Bias-Variance Trade-offs in Data Acquisition · EC 2021

Methods — techniques the papers use, named apart from their topics

mechanism design · 1.0bias-variance trade-off · 1.0
YearPublicationVenuePosition
2021 The Privacy Paradox and Optimal Bias-Variance Trade-offs in Data Acquisition
abstract
While 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 her data, it is not just her 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, where 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 non-monotonicity properties of the marketplace.
Guocheng Liao, Yu Su 0013, Juba Ziani, Adam Wierman, Jianwei Huang 0001
EC2