mlsanityData to 14 Oct 2026

Exploration and Persuasion

arXiv 2410.17086 ↗First posted 22 Oct 2024cs.GT cs.LG econ.THcited by 1

Not on the map. Why?

Abstract (arXiv)

How to incentivize self-interested agents to explore when they prefer to exploit? Consider a population of self-interested agents that make decisions under uncertainty. They "explore" to acquire new information and "exploit" this information to make good decisions. Collectively they need to balance these two objectives, but their incentives are skewed toward exploitation. This is because exploration is costly, but its benefits are spread over many agents in the future. "Incentivized Exploration" addresses this issue via strategic communication. Consider a benign ``principal" which can communicate with the agents and make recommendations, but cannot force the agents to comply. Moreover, suppose the principal can observe the agents' decisions and the outcomes of these decisions. The goal is to design a communication and recommendation policy which (i) achieves a desirable balance between exploration and exploitation, and (ii) incentivizes the agents to follow recommendations. What makes it feasible is "information asymmetry": the principal knows more than any one agent, as it collects information from many. It is essential that the principal does not fully reveal all its knowledge to the agents. Incentivized exploration combines two important problems in, resp., machine learning and theoretical economics. First, if agents always follow recommendations, the principal faces a multi-armed bandit problem: essentially, design an algorithm that balances exploration and exploitation. Second, interaction with a single agent corresponds to "Bayesian persuasion", where a principal leverages information asymmetry to convince an agent to take a particular action. We provide a brief but self-contained introduction to each problem through the lens of incentivized exploration, solving a key special case of the former as a sub-problem of the latter.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 10 of its 31 references that are in the map. First posted on arXiv 22 Oct 2024.

Builds on

10 of 31 references.

References · 10

  1. 2019Introduction to Multi-Armed Banditscited by 481
  2. 2017Mostly Exploration-Free Algorithms for Contextual Banditscited by 85
  3. 2015Bayesian Incentive-Compatible Bandit Explorationcited by 53
  4. 2016Bayesian Exploration: Incentivizing Exploration in Bayesian Gamescited by 37
  5. 2020The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexitycited by 26
  6. 2018Incentivizing Exploration with Selective Data Disclosurecited by 24
  7. 2020Greedy Algorithm almost Dominates in Smoothed Contextual Banditscited by 20
  8. 2015Economic Recommendation Systemscited by 8
  9. 2016Descending Price Optimally Coordinates Searchcited by 8
  10. 2018Overabundant Information and Learning Trapscited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.