Competing Bandits: The Perils of Exploration Under Competition

Most online platforms learn from interactions with users and engage in exploration : making potentially suboptimal choices to acquire new information. We study the interplay between exploration and competition : how such platforms balance the exploration for learning and competition for users. We consider a stylized duopoly in which two firms face the same multi-armed bandit problem. Users arrive one by one and choose between the two firms, so that each firm makes progress on its bandit problem only if it is chosen. We study whether competition incentivizes the adoption of better algorithms. We find that stark competition disincentivizes exploration, leading to low welfare. However, weaker competition incentivizes better exploration algorithms and increases welfare. We investigate two channels for weakening the competition: stochastic user choice models and a first-mover advantage. Our findings speak to the competition–innovation relationship and the first-mover advantage in the digital economy.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Economics and Computation
Published
2025-01-10
DOI
https://doi.org/10.1145/3711831
Citations
5
Primary Topic
Advanced Bandit Algorithms Research
Type
article
Field-Weighted Citation Impact
2.11
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Competing Bandits: The Perils of Exploration Under Competition

Zhiwei Steven Wu, Yishay Mansour, Aleksandrs Slivkins, Guy Aridor
5 citations
ACM Transactions on Economics and Computation
Advanced Bandit Algorithms Research
2.11
article

Competing Bandits: The Perils of Exploration Under Competition

Zhiwei Steven Wu, Yishay Mansour, Aleksandrs Slivkins, Guy Aridor
article en
5 citations

Abstract

Most online platforms learn from interactions with users and engage in exploration : making potentially suboptimal choices to acquire new information. We study the interplay between exploration and competition : how such platforms balance the exploration for learning and competition for users. We consider a stylized duopoly in which two firms face the same multi-armed bandit problem. Users arrive one by one and choose between the two firms, so that each firm makes progress on its bandit problem only if it is chosen. We study whether competition incentivizes the adoption of better algorithms. We find that stark competition disincentivizes exploration, leading to low welfare. However, weaker competition incentivizes better exploration algorithms and increases welfare. We investigate two channels for weakening the competition: stochastic user choice models and a first-mover advantage. Our findings speak to the competition–innovation relationship and the first-mover advantage in the digital economy.

ACM Transactions on Economics and ComputationVol. 13(1)
Northwestern University (US), Microsoft (United States) (US), Tel Aviv University (IL), Carnegie Mellon University (US)
Industry, innovation and infrastructure
Openalex Percentile: Top 17%
Advanced Bandit Algorithms Research
2.11
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.