Incentivizing Exploration with Heterogeneous Value of Money
Not on the map. Why?
Abstract (arXiv)
Recently, Frazier et al. proposed a natural model for crowdsourced exploration of different a priori unknown options: a principal is interested in the long-term welfare of a population of agents who arrive one by one in a multi-armed bandit setting. However, each agent is myopic, so in order to incentivize him to explore options with better long-term prospects, the principal must offer the agent money. Frazier et al. showed that a simple class of policies called time-expanded are optimal in the worst case, and characterized their budget-reward tradeoff. The previous work assumed that all agents are equally and uniformly susceptible to financial incentives. In reality, agents may have different utility for money. We therefore extend the model of Frazier et al. to allow agents that have heterogeneous and non-linear utilities for money. The principal is informed of the agent's tradeoff via a signal that could be more or less informative. Our main result is to show that a convex program can be used to derive a signal-dependent time-expanded policy which achieves the best possible Lagrangian reward in the worst case. The worst-case guarantee is matched by so-called "Diamonds in the Rough" instances; the proof that the guarantees match is based on showing that two different convex programs have the same optimal solution for these specific instances. These results also extend to the budgeted case as in Frazier et al. We also show that the optimal policy is monotone with respect to information, i.e., the approximation ratio of the optimal policy improves as the signals become more informative.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Dec 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 1; 2025: 2.
6 papers.
- 2023Bandit Social Learning: Exploration under Myopic Behaviorcited by 6
- 2021(Almost) Free Incentivized Exploration from Decentralized Learning Agentscited by 3
- 2024Incentivized Exploration of Non-Stationary Stochastic Banditscited by 3
- 2025Incentivized Lipschitz Banditscited by 2
- 2023Reward Teaching for Federated Multi-armed Banditscited by 0
- 2025Learning with Limited Shared Information in Multi-agent Multi-armed Banditcited by 0
- 2025Incentivized Lipschitz Bandits26 Aug 2025
- 2025Learning with Limited Shared Information in Multi-agent Multi-armed Bandit21 Feb 2025
- 2024Incentivized Exploration of Non-Stationary Stochastic Bandits16 Mar 2024
- 2023Reward Teaching for Federated Multi-armed Bandits3 May 2023
- 2023Bandit Social Learning: Exploration under Myopic Behavior15 Feb 2023
- 2021(Almost) Free Incentivized Exploration from Decentralized Learning Agents27 Oct 2021