Learning to Persuade Privately Informed Receivers

• URL: http://arxiv.org/abs/2607.28342v1
• Date: Thu, 30 Jul 2026 15:08:41 GMT
• Title: Learning to Persuade Privately Informed Receivers
• Abstract summary: This paper studies how an informed sender can influence the behavior of a receiver through strategic information disclosure.<n>Standard models assume the sender is the receiver's only source of information, yet in many applications receivers also consult external sources.<n>Our key insight is reducing the problem of learning the exponentially large belief-space partitioning induced by the private scheme to a one-dimensional change-point detection problem.
• Score: 21.585615386843628
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bayesian persuasion studies how an informed sender can influence the behavior of a receiver through strategic information disclosure. Standard models assume the sender is the receiver's only source of information, yet in many applications receivers also consult external sources the sender can neither observe nor control. We study an online Bayesian persuasion problem in which a binary-action receiver has access to a fixed signaling scheme that is unknown to the sender. Over $T$ rounds, the sender commits to a signaling scheme and sends a signal; the receiver combines it with its private signal and acts, while the sender observes only the action. We design a learning algorithm that achieves regret $\widetilde{O}(T^{3/4})$ relative to the optimal scheme of a sender who knows the private signaling scheme of the receiver, with polynomial dependence on the sizes of the state space and the receiver's signal alphabet. Our key insight is reducing the problem of learning the exponentially large belief-space partitioning induced by the private scheme to a one-dimensional change-point detection problem.

Related papers

• CSI Obfuscation: Single-Antenna Transmitters Can Not Hide from Adversarial Multi-Antenna Radio Localization Systems [5.881727527356694]
  Single-antenna transmitters can obfuscate the signal by convolving it with a randomized sequence prior to transmission.<n>This strategy is only effective against CSI-based localization systems deploying single-antenna receivers.<n>Inspired by the concept of blind multichannel identification, we propose a simple CSI recovery method for multi-antenna receivers.
  arXiv  Detail & Related papers  (2025-08-04T16:04:20Z)
• Learning How to Strategically Disclose Information [6.267574471145217]
  We consider an online version of information design where a sender interacts with a receiver of an unknown type. We show that $mathcalO(sqrtT)$ regret is achievable with full information feedback. We also propose a novel parametrization that allows the sender to achieve $mathcalO(sqrtT)$ regret for a general convex utility function.
  arXiv  Detail & Related papers  (2024-03-13T17:44:16Z)
• Algorithmic Persuasion Through Simulation [51.23082754429737]
  We study a Bayesian persuasion game where a sender wants to persuade a receiver to take a binary action.<n>The sender is informed about the (real-valued) state of the world, such as the quality of the product, but only has limited information about the receiver's beliefs and utilities.<n>Motivated by customer surveys, user studies, and recent advances in AI, we allow the sender to learn more about the receiver.
  arXiv  Detail & Related papers  (2023-11-29T23:01:33Z)
• Persuading a Behavioral Agent: Approximately Best Responding and Learning [7.378697321839991]
  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, the sender can find a signaling scheme that guarantees itself an expected utility almost as good as its optimal utility.
  arXiv  Detail & Related papers  (2023-02-07T19:12:46Z)
• Vulnerabilities of Deep Learning-Driven Semantic Communications to Backdoor (Trojan) Attacks [70.51799606279883]
  This paper highlights vulnerabilities of deep learning-driven semantic communications to backdoor (Trojan) attacks. Backdoor attack can effectively change the semantic information transferred for poisoned input samples to a target meaning. Design guidelines are presented to preserve the meaning of transferred information in the presence of backdoor attacks.
  arXiv  Detail & Related papers  (2022-12-21T17:22:27Z)
• Is Semantic Communications Secure? A Tale of Multi-Domain Adversarial Attacks [70.51799606279883]
  We introduce test-time adversarial attacks on deep neural networks (DNNs) for semantic communications. We show that it is possible to change the semantics of the transferred information even when the reconstruction loss remains low.
  arXiv  Detail & Related papers  (2022-12-20T17:13:22Z)
• Sequential Information Design: Learning to Persuade in the Dark [49.437419242582884]
  We study a repeated information design problem faced by an informed sender who tries to influence the behavior of a self-interested receiver. At each round, the sender observes the realizations of random events in the sequential decision making (SDM) problem. This begets the challenge of how to incrementally disclose such information to the receiver to persuade them to follow (desirable) action recommendations.
  arXiv  Detail & Related papers  (2022-09-08T17:08:12Z)
• Multi-Receiver Online Bayesian Persuasion [51.94795123103707]
  We study an online learning framework in which the sender repeatedly faces a receiver of an unknown, adversarially selected type. We focus on the case with no externalities and binary actions, as customary in offline models. We introduce a general online descent scheme to handle online learning problems with a finite number of possible loss functions.
  arXiv  Detail & Related papers  (2021-06-11T16:05:31Z)
• FedRec: Federated Learning of Universal Receivers over Fading Channels [92.15358738530037]
  We propose a neural network-based symbol detection technique for downlink fading channels. Multiple users collaborate to jointly learn a universal data-driven detector, hence the name FedRec. The performance of the resulting receiver is shown to approach the MAP performance in diverse channel conditions without requiring knowledge of the fading statistics.
  arXiv  Detail & Related papers  (2020-11-14T11:29:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.