Incentivizing Exploration in Linear Bandits under Information Gap
Not on the map. Why?
Abstract (arXiv)
We study the problem of incentivizing exploration for myopic users in linear bandits, where the users tend to exploit arm with the highest predicted reward instead of exploring. In order to maximize the long-term reward, the system offers compensation to incentivize the users to pull the exploratory arms, with the goal of balancing the trade-off among exploitation, exploration and compensation. We consider a new and practically motivated setting where the context features observed by the user are more informative than those used by the system, e.g., features based on users' private information are not accessible by the system. We propose a new method to incentivize exploration under such information gap, and prove that the method achieves both sublinear regret and sublinear compensation. We theoretical and empirically analyze the added compensation due to the information gap, compared with the case that the system has access to the same context features as the user, i.e., without information gap. We also provide a compensation lower bound of our problem.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 10 of its 25 references that are in the map. First posted on arXiv 8 Apr 2021.
Builds on
10 of 25 references.
References · 10
- 2015Bayesian Incentive-Compatible Bandit Explorationcited by 53
- 2020Impact of Representation Learning in Linear Banditscited by 51
- 2016The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Banditscited by 48
- 2018Incentivizing Exploration with Selective Data Disclosurecited by 24
- 2019Stochastic Linear Bandits with Hidden Low Rank Structurecited by 14
- 2018Multi-armed Bandits with Compensationcited by 13
- 2017Fairness Incentives for Myopic Agentscited by 10
- 2019Incentivized Exploration for Multi-Armed Bandits under Reward Driftcited by 6
- 2017Learning User Preferences to Incentivize Exploration in the Sharing Economycited by 4
- 2020Incentivising Exploration and Recommendations for Contextual Bandits with Paymentscited by 4
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 0; 2025: 2.
5 papers.
- 2023Incentivizing Exploration with Linear Contexts and Combinatorial Actionscited by 5
- 2021(Almost) Free Incentivized Exploration from Decentralized Learning Agentscited by 3
- 2023MERMAIDE: Learning to Align Learners using Model-Based Meta-Learningcited by 0
- 2025Learning with Limited Shared Information in Multi-agent Multi-armed Banditcited by 0
- 2025Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluationcited by 0
- 2025Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation24 Jul 2025
- 2025Learning with Limited Shared Information in Multi-agent Multi-armed Bandit21 Feb 2025
- 2023Incentivizing Exploration with Linear Contexts and Combinatorial Actions3 Jun 2023
- 2023MERMAIDE: Learning to Align Learners using Model-Based Meta-Learning10 Apr 2023
- 2021(Almost) Free Incentivized Exploration from Decentralized Learning Agents27 Oct 2021