Informativeness and Trust in Bayesian Persuasion

TL;DR

This paper analyzes Bayesian persuasion, characterizing the maximum utility and truthful information revealed through linear programming, highlighting the importance of trust constraints and informativeness in persuasion strategies.

Contribution

It introduces a linear programming framework to quantify the Stackelberg game value and informativeness, incorporating trust constraints that limit obfuscation in Bayesian persuasion.

Findings

Stackelberg game value characterized by linear program.

Informativeness defined via linear program with trust constraints.

Closed-form solutions provided for structured utility functions.

Abstract

A persuasion policy successfully persuades an agent to pick a particular action only if the information is designed in a manner that convinces the agent that it is in their best interest to pick that action. Thus, it is natural to ask, what makes the agent trust the persuader's suggestion? We study a Bayesian persuasion interaction between a sender and a receiver where the sender has access to private information and the receiver attempts to recover this information from messages sent by the sender. The sender crafts these messages in an attempt to maximize its utility which depends on the source symbol and the symbol recovered by the receiver. Our goal is to characterize the \textit{Stackelberg game value}, and the amount of true information revealed by the sender during persuasion. We find that the SGV is given by the optimal value of a \textit{linear program} on probability distributions constrained by certain \textit{trust constraints}. These constraints encode that any signal in a persuasion strategy must contain more truth than untruth and thus impose a fundamental bound on the extent of obfuscation a sender can perform. We define \textit{informativeness} of the sender as the minimum expected number of symbols truthfully revealed by the sender in any accumulation point of a sequence of $\varepsilon$-equilibrium persuasion strategies, and show that it is given by another linear program. Informativeness is a fundamental bound on the amount of information the sender must reveal to persuade a receiver. Closed form expressions for the SGV and the informativeness are presented for structured utility functions. This work generalizes our previous work where the sender and the receiver were constrained to play only deterministic strategies and a similar notion of informativeness was characterized. Comparisons between the previous and current notions are discussed.