Algorithmic Targeting and the Precision-Recall Tradeoff

We examine the implications of competitive algorithmic targeting when outcomes of targeting algorithms are the individual consumer-level predicted probabilities of conversion. In these situations, firms implicitly face the well-known precision-recall tradeoff while choosing their targeting strategies. They can choose to target a smaller set of consumers with a high probability of conversion (precision) but miss out on many consumers who might still be interested in their product. Conversely, firms can target a larger set of consumers (recall), but this results in a greater probability that their targeting is wasted on uninterested consumers. We analyze this precision-recall tradeoff under competition between firms that strategically choose their algorithmic targeting policies. We show that competing firms favor a targeting policy that has higher precision but lower recall compared with a monopoly. Firms target fewer consumers when their algorithms are more correlated. They also have the incentive to strategically decrease the precision of their targeting policies in order to reduce competition. If firms endogenously choose their algorithmic correlation, then there is an equilibrium incentive to decrease the correlation. History: Anthony Dukes served as the senior editor for this article. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mksc.2024.0930 .

Authors

Institutions

Publication Details

Journal
Marketing Science
Published
2026-03-23
DOI
https://doi.org/10.1287/mksc.2024.0930
Primary Topic
Consumer Market Behavior and Pricing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Algorithmic Targeting and the Precision-Recall Tradeoff

Zemin Zhong, Yugui Yao, Ganesh Iyer
Marketing Science
Consumer Market Behavior and Pricing
article

Algorithmic Targeting and the Precision-Recall Tradeoff

Zemin Zhong, Yugui Yao, Ganesh Iyer
article en

Abstract

We examine the implications of competitive algorithmic targeting when outcomes of targeting algorithms are the individual consumer-level predicted probabilities of conversion. In these situations, firms implicitly face the well-known precision-recall tradeoff while choosing their targeting strategies. They can choose to target a smaller set of consumers with a high probability of conversion (precision) but miss out on many consumers who might still be interested in their product. Conversely, firms can target a larger set of consumers (recall), but this results in a greater probability that their targeting is wasted on uninterested consumers. We analyze this precision-recall tradeoff under competition between firms that strategically choose their algorithmic targeting policies. We show that competing firms favor a targeting policy that has higher precision but lower recall compared with a monopoly. Firms target fewer consumers when their algorithms are more correlated. They also have the incentive to strategically decrease the precision of their targeting policies in order to reduce competition. If firms endogenously choose their algorithmic correlation, then there is an equilibrium incentive to decrease the correlation. History: Anthony Dukes served as the senior editor for this article. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mksc.2024.0930 .

Marketing Science
City University of Hong Kong (HK), Chinese University of Hong Kong (HK), University of California, Berkeley (US)
Openalex Percentile: Top 9%
Consumer Market Behavior and Pricing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.