Pith. sign in

REVIEW 3 cited by

Persuading a Behavioral Agent: Approximately Best Responding and Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.03719 v2 pith:DTZXYVJ6 submitted 2023-02-07 cs.GT cs.LGecon.TH

classification cs.GTcs.LGecon.TH
keywords senderreceiverschememodelbayesianapproximatelyclassicpersuasion
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Leakage-Robust Bayesian Persuasion

    cs.GT 2024-11 conditional novelty 8.0 of 10

    This paper introduces leakage-robust Bayesian persuasion and proves that the price of worst-case robustness is Theta(min{2^k, n}) for supermodular preferences and Theta(k) for submodular preferences, with improved bou...

  2. Learning to Play Against Unknown Opponents

    cs.GT 2024-12 accept novelty 7.0 of 10

    For repeated games against an unknown optimizer type, the paper gives polynomial-time optimal no-regret commitment, near-optimal general commitment when the game or support size is constant, a polynomial-per-step maxi...

  3. Bayesian Risk Preference Persuasion

    math.OC 2026-07 conditional novelty 6.0 of 10

    Information design can steer a receiver's coherent risk preference through Bayes-plausible belief changes, and the paper derives conditions and signal rules for when this benefits a sender.

Pith tools