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
- Zhiwei Steven Wu (ORCID: https://orcid.org/0000-0002-8125-8227)
- Yishay Mansour (ORCID: https://orcid.org/0000-0001-6891-2645)
- Aleksandrs Slivkins (ORCID: https://orcid.org/0000-0001-6899-6383)
- Guy Aridor (ORCID: https://orcid.org/0000-0003-3109-4241)
Institutions
- Northwestern University (US)
- Microsoft (United States) (US)
- Tel Aviv University (IL)
- Carnegie Mellon University (US)
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