Persuading a Behavioral Agent: Approximately Best Responding and Learning
Not on the map. Why?
Abstract (arXiv)
The classic Bayesian persuasion model assumes a Bayesian and best-responding receiver. We study a relaxation of the Bayesian persuasion model where the receiver can approximately best respond to the sender's signaling scheme. We show that, under natural assumptions, (1) the sender can find a signaling scheme that guarantees itself an expected utility almost as good as its optimal utility in the classic model, no matter what approximately best-responding strategy the receiver uses; (2) on the other hand, there is no signaling scheme that gives the sender much more utility than its optimal utility in the classic model, even if the receiver uses the approximately best-responding strategy that is best for the sender. Together, (1) and (2) imply that the approximately best-responding behavior of the receiver does not affect the sender's maximal achievable utility a lot in the Bayesian persuasion problem. The proofs of both results rely on the idea of robustification of a Bayesian persuasion scheme: given a pair of the sender's signaling scheme and the receiver's strategy, we can construct another signaling scheme such that the receiver prefers to use that strategy in the new scheme more than in the original scheme, and the two schemes give the sender similar utilities. As an application of our main result (1), we show that, in a repeated Bayesian persuasion model where the receiver learns to respond to the sender by some algorithms, the sender can do almost as well as in the classic model. Interestingly, unlike (2), with a learning receiver the sender can sometimes do much better than in the classic model.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 12 of its 41 references that are in the map. First posted on arXiv 7 Feb 2023.
Builds on
12 of 41 references.
References · 12
- 2019Strategizing against No-regret Learnerscited by 48
- 2017Selling to a No-Regret Buyercited by 43
- 2022Strategizing against Learners in Bayesian Gamescited by 33
- 2015Algorithmic Bayesian Persuasioncited by 21
- 2020Mechanisms for a No-Regret Agent: Beyond the Common Priorcited by 18
- 2022Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learningcited by 18
- 2021Learning to Persuade on the Fly: Robustness Against Ignorancecited by 12
- 2021Multi-Receiver Online Bayesian Persuasioncited by 12
- 2022Rationality-Robust Information Design: Bayesian Persuasion under Quantal Responsecited by 6
- 2021Regret-Minimizing Bayesian Persuasioncited by 5
- 2022No-Regret Bayesian Recommendation to Homogeneous Userscited by 3
- 2022Persuading Risk-Conscious Agents: A Geometric Approachcited by 2
Built on by
Citing papers per year: 2024: 4; 2025: 2; 2026: 1.
7 papers.
- 2024The Double-Edged Sword of Behavioral Responses in Strategic Classification: Theory and User Studiescited by 9
- 2024Strategically-Robust Learning Algorithms for Bidding in First-Price Auctionscited by 7
- 2024Maximizing utility in multi-agent environments by anticipating the behavior of other learnerscited by 7
- 2024Learning to Play Against Unknown Opponentscited by 3
- 2025Computational Intractability of Strategizing against Online Learnerscited by 2
- 2025Best of Both Worlds: Regret Minimization versus Minimax Playcited by 1
- 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
- 2025Computational Intractability of Strategizing against Online Learners6 Mar 2025
- 2025Best of Both Worlds: Regret Minimization versus Minimax Play17 Feb 2025
- 2024Learning to Play Against Unknown Opponents24 Dec 2024
- 2024The Double-Edged Sword of Behavioral Responses in Strategic Classification: Theory and User Studies23 Oct 2024
- 2024Maximizing utility in multi-agent environments by anticipating the behavior of other learners5 Jul 2024
- 2024Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions12 Feb 2024