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

Ron Berman

dblp:23/2484 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0002-8594-3627ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1 · 1 first-authorTheory 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Network and information security
1 paper
Privacy and data protection · 67% Network security · 33%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities
field experiments
0.812024
When Is Heterogeneity Actionable for Targeting? · EC 2024
Privacy and data protection
anonymity
0.212015
Provable Unlinkability Against Traffic Analysis with Low Message Overhead · J. Cryptol. 2015
Network security
traffic analysis
0.212015
Provable Unlinkability Against Traffic Analysis with Low Message Overhead · J. Cryptol. 2015
Privacy and data protection › anonymity
unlinkability
0.212015
Provable Unlinkability Against Traffic Analysis with Low Message Overhead · J. Cryptol. 2015

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

causal inference · 1.5a/b testing · 1.5provable security · 0.2
YearPublicationVenuePosition
2024 When Is Heterogeneity Actionable for Targeting?
abstract
When A/B/n tests (aka megastudies) have covariates that describe individuals, they can potentially be used to design targeting policies, i.e., to achieve better outcomes by assigning optimal interventions for specific individuals rather than applying the same intervention to everyone. We applied five popular targeting approaches to two large-scale field experiments with many interventions aimed at increasing vaccination rates (the Walmart study of [Milkman et al., 2022]) and the Penn-Geisinger study of [Milkman et al., 2021] and [Patel et al., 2023]), and found limited value of targeting in the Walmart experiment and a four times higher value of targeting in the Penn-Geisinger experiment. Our research explains the difference in the gains from personalization between the two studies and shows that neither heterogeneity in responses nor independence across potential outcomes within individuals is sufficient to predict whether a targeting exercise will be successful. Instead, a specific form of heterogeneity, which we call "actionable" heterogeneity, determines the value of targeting. Namely, to be "actionable"' for targeting, heterogeneity that moderates the treatment effects within different subgroups is not sufficient. It also needs to have a few subgroups for which the most successful intervention is not the same. Visually, this appears as a crossover between one intervention and another, if the individuals are ranked by their treatment effects. We show that the magnitude of crossovers with the best-performing intervention determines what portion of heterogeneity is "actionable"' for targeting.
Anya Shchetkina, Ron Berman
EC2
2015 Provable Unlinkability Against Traffic Analysis with Low Message Overhead
Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski, Tomer Levinboim, Amnon Ta-Shma
J. Cryptol.1