最佳信息传输
Optimal Transport of Information
摘要:
我们研究的一般问题的贝叶斯说服(最优信息设计)与连续的行动和连续的状态空间在任意维度。首先,我们证明了在有限的信号空间中,最优信息设计总是由一个划分给出。其次,我们采取的限制,一个无限的信号空间和表征的解决方案的Monge-Kantorovich最优运输问题的内生信息运输成本。我们使用我们的新方法:1。基于非凸函数的Bregman发散性,导出最优性的充分必要条件。2.计算最优策略支持度的Hausdorff维数的精确界。3.导出一个非线性二阶偏微分方程,其解对应于正则最优策略。我们说明了我们的方法提供明确的解决方案,几个非线性,多维贝叶斯说服问题的力量。
英文摘要:
We study the general problem of Bayesian persuasion (optimal information design) with continuous actions and continuous state space in arbitrary dimensions. First, we show that with a finite signal space, the optimal information design is always given by a partition. Second, we take the limit of an infinite signal space and characterize the solution in terms of a Monge-Kantorovich optimal transport problem with an endogenous information transport cost. We use our novel approach to: 1. Derive necessary and sufficient conditions for optimality based on Bregman divergences for non-convex functions. 2. Compute exact bounds for the Hausdorff dimension of the support of an optimal policy. 3. Derive a non-linear, second-order partial differential equation whose solutions correspond to regular optimal policies. We illustrate the power of our approach by providing explicit solutions to several non-linear, multidimensional Bayesian persuasion problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。