Pith. sign in

REVIEW 1 cited by

Bayesian Persuasion in Sequential Decision-Making

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 2106.05137 v2 pith:VJ435TGA submitted 2021-06-09 cs.GT

classification cs.GT
keywords agentprincipalstrategyactionsoptimaltimeadvicebayesian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition

    cs.LG 2025-05 conditional novelty 6.0 of 10

    OIAFC and OIAFB identify an (epsilon, delta)-optimal scoring rule in online principal-agent information acquisition with instance-dependent sample complexity, but the proven rate differs from the advertised rate.

Pith tools