Bayesian Exploration with Heterogeneous Agents
Not on the map. Why?
Abstract (arXiv)
It is common in recommendation systems that users both consume and produce information as they make strategic choices under uncertainty. While a social planner would balance "exploration" and "exploitation" using a multi-armed bandit algorithm, users' incentives may tilt this balance in favor of exploitation. We consider Bayesian Exploration: a simple model in which the recommendation system (the "principal") controls the information flow to the users (the "agents") and strives to incentivize exploration via information asymmetry. A single round of this model is a version of a well-known "Bayesian Persuasion game" from [Kamenica and Gentzkow]. We allow heterogeneous users, relaxing a major assumption from prior work that users have the same preferences from one time step to another. The goal is now to learn the best personalized recommendations. One particular challenge is that it may be impossible to incentivize some of the user types to take some of the actions, no matter what the principal does or how much time she has. We consider several versions of the model, depending on whether and when the user types are reported to the principal, and design a near-optimal "recommendation policy" for each version. We also investigate how the model choice and the diversity of user types impact the set of actions that can possibly be "explored" by each type.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 4; 2024: 2; 2025: 2; 2026: 2.
12 papers.
- 2021Bayesian Persuasion for Algorithmic Recoursecited by 14
- 2023Strategic Apple Tastingcited by 10
- 2023Incentivizing Exploration with Linear Contexts and Combinatorial Actionscited by 5
- 2021Incentivizing Compliance with Algorithmic Instrumentscited by 4
- 2024Incentivized Exploration of Non-Stationary Stochastic Banditscited by 3
- 2025Incentivized Lipschitz Banditscited by 2
- 2024Misalignment, Learning, and Ranking: Harnessing Users Limited Attentioncited by 1
- 2023Bounded (O(1)) Regret Recommendation Learning via Synthetic Controls Oraclecited by 0
- 2023Incentivized Collaboration in Active Learningcited by 0
- 2025Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contextscited by 0
- 2026Prior-Agnostic Incentive-Compatible Explorationcited by 0
- 2026On Incentivized Exploration beyond Bayesianism and Full-Informationcited by 0
- 2026On Incentivized Exploration beyond Bayesianism and Full-Information14 Jul 2026
- 2026Prior-Agnostic Incentive-Compatible Exploration24 Feb 2026
- 2025Incentivized Lipschitz Bandits26 Aug 2025
- 2025Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts2 Jun 2025
- 2024Incentivized Exploration of Non-Stationary Stochastic Bandits16 Mar 2024
- 2024Misalignment, Learning, and Ranking: Harnessing Users Limited Attention21 Feb 2024
- 2023Incentivized Collaboration in Active Learning1 Nov 2023
- 2023Strategic Apple Tasting9 Jun 2023
- 2023Incentivizing Exploration with Linear Contexts and Combinatorial Actions3 Jun 2023
- 2023Bounded (O(1)) Regret Recommendation Learning via Synthetic Controls Oracle29 Jan 2023
- 2021Bayesian Persuasion for Algorithmic Recourse12 Dec 2021
- 2021Incentivizing Compliance with Algorithmic Instruments21 Jul 2021