pith. sign in

arxiv: 2602.05835 · v2 · pith:GNQ2WJK5new · submitted 2026-02-05 · 💻 cs.GT

Bandit Social Learning with Exploration Episodes

classification 💻 cs.GT
keywords explorationagentagentsbanditepisodesevenjustlearning
0
0 comments X
read the original abstract

We study a stylized social learning dynamics where self-interested agents collectively follow a simple multi-armed bandit protocol. Each agent controls an ``episode": a short sequence of consecutive decisions. Motivating applications include users repeatedly interacting with an AI, or repeatedly shopping at a marketplace. While agents are incentivized to explore within their respective episodes, we show that the aggregate exploration fails: e.g., its Bayesian regret grows linearly over time. In fact, such failure is a (very) typical case, not just a worst-case scenario. This conclusion persists even if an agent's per-episode utility is some fixed function of the per-round outcomes: e.g., $\min$ or $\max$, not just the sum. Thus, externally driven exploration is needed even when some amount of exploration happens organically.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Collaborating in Multi-Armed Bandits with Strategic Agents

    cs.LG 2026-05 unverdicted novelty 7.0

    CAOS sustains collaboration as a Nash equilibrium among persistent strategic agents in Bayesian multi-armed bandits via information sharing, with strong regret guarantees.