Timely Information for Strategic Persuasion
Ahmet Bugra Gundogan, Melih Bastopcu

TL;DR
This paper studies a dynamic Bayesian persuasion model where a strategic sender influences a receiver's belief over time by controlling information disclosure, optimizing long-term persuasion under resource and incentive constraints.
Contribution
It introduces a novel continuous-time, multi-source Bayesian persuasion framework with incentive compatibility, deriving optimal policies for information control and demonstrating their effectiveness.
Findings
Optimal policy allocates minimal sampling to undesired states
Timely information can significantly increase persuasion utility
Extension from single-source to multi-source scenarios
Abstract
This work investigates a dynamic variant of Bayesian persuasion, in which a strategic sender seeks to influence a receiver's belief over time through controlling the timing of the information disclosure, under resource constraints. We consider a binary information source (i.e., taking values 0 or 1), where the source's state evolve according to a continuous-time Markov chain (CTMC). In this setting, the receiver aims to estimate the source's state as accurately as possible. In contrast, the sender seeks to persuade the receiver to estimate the state to be 1, regardless of whether this estimate reflects the true state. This misalignment between their objectives naturally leads to a Stackelberg game formulation where the sender, acting as the leader, chooses an information-revelation policy, and the receiver, as the follower, decides whether to follow the sender's messages. As a result,…
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
TopicsGame Theory and Applications · Age of Information Optimization · Advanced Bandit Algorithms Research
