← 研踪 PaperTrailarXiv:2611.16327 · v1
Designing Information in a Forest: Algorithmic Aspects
首次提交 2026-11-12 13:49
版本更新 2026-11-12 13:49
雷达观测 2026-11-13 14:16
摘要
The Bayesian persuasion framework models strategic information revelation by a sender to one or more receivers. We study an intricate version of the multi-receiver persuasion setting in which the communication hierarchy is a forest - i.e., some receivers observe more informative signals than others, and the partial ordering of the receivers according to the information they get is represented by a pre-specified directed forest. This model naturally captures interactions in hierarchical organizations, and it lies in between the two most commonly studied versions of Bayesian persuasion: private persuasion and public persuasion. Inspired by the classic model of private persuasion, we focus on a setting with a binary state of nature and binary-action heterogeneous receivers s.t. the sender's utility is a monotone function of the set of receivers taking a specific desirable action. We extend the computational tractability result for symmetric sender's utility from private persuasion to the forest hierarchy framework using methodology inspired by optimal transport theory. We further provide a polynomial-time algorithm when the sender's utility is modular. On the negative side, we show that, unlike in private persuasion, the case of a supermodular sender's utility function leads to an NP-hard optimization problem which further does not admit an FPTAS unless P=NP; this result holds even when each tree component of the forest is a chain of 3 receivers. To complement the hardness result, we provide a simple approximation algorithm with the approximation ratio depending linearly on the depth of the forest hierarchy. We further provide an analogous algorithm for the submodular utility case. Finally, beyond forest communication hierarchies, we rule out an FPTAS for the sender's optimal utility even in the symmetric utility case, unless P=NP.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-12 13:49 · 最新观测版本
Designing Information in a Forest: Algorithmic Aspects
The Bayesian persuasion framework models strategic information revelation by a sender to one or more receivers. We study an intricate version of the multi-receiver persuasion setting in which the communication hierarchy is a forest - i.e., some receivers observe more informative signals than others, and the partial ordering of the receivers according to the information they get is represented by a pre-specified directed forest. This model naturally captures interactions in hierarchical organizations, and it lies in between the two most commonly studied versions of Bayesian persuasion: private persuasion and public persuasion. Inspired by the classic model of private persuasion, we focus on a setting with a binary state of nature and binary-action heterogeneous receivers s.t. the sender's utility is a monotone function of the set of receivers taking a specific desirable action. We extend the computational tractability result for symmetric sender's utility from private persuasion to the forest hierarchy framework using methodology inspired by optimal transport theory. We further provide a polynomial-time algorithm when the sender's utility is modular. On the negative side, we show that, unlike in private persuasion, the case of a supermodular sender's utility function leads to an NP-hard optimization problem which further does not admit an FPTAS unless P=NP; this result holds even when each tree component of the forest is a chain of 3 receivers. To complement the hardness result, we provide a simple approximation algorithm with the approximation ratio depending linearly on the depth of the forest hierarchy. We further provide an analogous algorithm for the submodular utility case. Finally, beyond forest communication hierarchies, we rule out an FPTAS for the sender's optimal utility even in the symmetric utility case, unless P=NP.
查看此版本解读 →查看此版本原文 ↗