Bayesian Persuasion in Sequential Decision-Making
Not on the map. Why?
Abstract (arXiv)
We study a dynamic model of Bayesian persuasion in sequential decision-making settings. An informed principal observes an external parameter of the world and advises an uninformed agent about actions to take over time. The agent takes actions in each time step based on the current state, the principal's advice/signal, and beliefs about the external parameter. The action of the agent updates the state according to a stochastic process. The model arises naturally in many applications, e.g., an app (the principal) can advice the user (the agent) on possible choices between actions based on additional real-time information the app has. We study the problem of designing a signaling strategy from the principal's point of view. We show that the principal has an optimal strategy against a myopic agent, who only optimizes their rewards locally, and the optimal strategy can be computed in polynomial time. In contrast, it is NP-hard to approximate an optimal policy against a far-sighted agent. Further, if the principal has the power to threaten the agent by not providing future signals, then we can efficiently compute a threat-based strategy. This strategy guarantees the principal's payoff as if playing against an agent who is far-sighted but myopic to future signals.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Jun 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 3; 2025: 4; 2026: 1.
12 papers.
- 2022Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learningcited by 18
- 2022Sequential Information Design: Learning to Persuade in the Darkcited by 9
- 2023Information Design in Multi-Agent Reinforcement Learningcited by 9
- 2024Markov Persuasion Processes: Learning to Persuade from Scratchcited by 8
- 2024Efficient Model-agnostic Alignment via Bayesian Persuasioncited by 8
- 2024Roadmap on Incentive Compatibility for AI Alignment and Governance in Sociotechnical Systemscited by 6
- 2025Off-Policy Evaluation for Sequential Persuasion Process with Unobserved Confoundingcited by 1
- 2023Stochastic Principal-Agent Problems: Efficient Computation and Learningcited by 0
- 2025Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisitioncited by 0
- 2025Information Bargaining: Bilateral Commitment in Bayesian Persuasioncited by 0
- 2025The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportabilitycited by 0
- 2026Structured Reinforcement Learning for Bayesian Persuasion : Application to Intelligent Interactive Drivingcited by 0
- 2026Structured Reinforcement Learning for Bayesian Persuasion : Application to Intelligent Interactive Driving15 Jul 2026
- 2025The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability11 Jun 2025
- 2025Information Bargaining: Bilateral Commitment in Bayesian Persuasion6 Jun 2025
- 2025Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition23 May 2025
- 2025Off-Policy Evaluation for Sequential Persuasion Process with Unobserved Confounding1 Apr 2025
- 2024Efficient Model-agnostic Alignment via Bayesian Persuasion29 May 2024
- 2024Roadmap on Incentive Compatibility for AI Alignment and Governance in Sociotechnical Systems20 Feb 2024
- 2024Markov Persuasion Processes: Learning to Persuade from Scratch5 Feb 2024
- 2023Stochastic Principal-Agent Problems: Efficient Computation and Learning6 Jun 2023
- 2023Information Design in Multi-Agent Reinforcement Learning8 May 2023
- 2022Sequential Information Design: Learning to Persuade in the Dark8 Sep 2022
- 2022Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning22 Feb 2022