Accelerator and Brake: Dynamic Persuasion with Dead Ends
Zhuo Chen, Yun Liu

TL;DR
This paper analyzes how a principal optimally uses dynamic information disclosures to influence an agent's stopping time in a bandit experiment, balancing optimism and pessimism to maximize outcomes.
Contribution
It introduces a model where the principal's non-monotonic preferences lead to at most two strategic disclosures, revealing how risk aversion shapes optimal persuasion strategies.
Findings
Optimal policy involves at most two disclosures: an accelerator and a brake.
The disclosure pattern depends on the principal's risk aversion and trade-off between mean and risk of stopping times.
The Arrow-Pratt coefficient of absolute risk aversion determines the optimal disclosure structure.
Abstract
We study optimal dynamic persuasion in a bandit experimentation model where a principal, unlike in standard settings, has a single-peaked preference over the agent's stopping time. This non-monotonic preference arises because maximizing the agent's effort is not always in the principal's best interest, as it may lead to a dead end. The principal privately observes the agent's payoff upon success and uses the information as the instrument of incentives. We show that the optimal dynamic information policy involves at most two one-shot disclosures: an accelerator before the principal's optimal stopping time, persuading the agent to be optimistic, and a brake after the principal's optimal stopping time, persuading the agent to be pessimistic. A key insight of our analysis is that the optimal disclosure pattern -- whether gradual or one-shot -- depends on how the principal resolves a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Game Theory and Applications · Auction Theory and Applications
