# Optimal Transport of Information

@article{Malamud2021OptimalTO, title={Optimal Transport of Information}, author={Semyon Malamud and Anna Cieślak and Andreas Schrimpf}, journal={Capital Markets: Market Efficiency eJournal}, year={2021} }

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…

## One Citation

Optimal Disclosure of Information to Privately Informed Agents

- EconomicsSSRN Electronic Journal
- 2021

We study information design settings where the designer controls information about a state, and there are multiple agents interacting in a game who are privately informed about their types. Each…

## References

SHOWING 1-10 OF 53 REFERENCES

Monotone Persuasion

- 2019

We explore Bayesian persuasion environments in which the state and action spaces are ordered, allowing for complementarity between actions and types. Building on the literature on monotone…

Bayesian Persuasion with Quadratic Preferences

- 2018

This paper examines the optimal information design within a Bayesian persuasion setup with multidimensional information. Assuming a linear-quadratic specification, I provide a new approach to the…

The Simple Economics of Optimal Persuasion

- 2017

We study Bayesian persuasion problems in which the Sender's preferences depend only on the mean of posterior beliefs. We show that, given a price schedule for posterior means, the Sender faces a…

On a problem of optimal transport under marginal martingale constraints

- Mathematics
- 2016

The basic problem of optimal transportation consists in minimizing the expected costs E[c(X 1 , X 2)] by varying the joint distribution (X 1 , X 2) where the marginal distributions of the random…

Optimal Persuasion via Bi-Pooling

- Computer ScienceSSRN Electronic Journal
- 2019

This paper introduces the class of bi-pooling policies and the induced distribution over posteriors and shows that this class of distributions characterizes the set of optimal distributions in the canonical Bayesian persuasion setting and identifies optimal information disclosure policies.

An optimal transport problem with backward martingale constraints motivated by insider trading

- Mathematics, Economics
- 2019

We study a single-period optimal transport problem on $\mathbb{R}^2$ with a covariance-type cost function $c(x,y) = (x_1-y_1)(x_2-y_2)$ and a backward martingale constraint. We show that a transport…

Repeated Games with Incomplete Information

- Computer ScienceEncyclopedia of Complexity and Systems Science
- 2009

This chapter discusses zero-sum games with lack of information on both sides, strategies, Payoffs, Value and Equilibria, and non-observable actions.

On the Optimality of Privacy in Sequential Contracting

- Economics, Computer ScienceJ. Econ. Theory
- 2006

This paper considers an environment where two principals sequentially contract with a common agent and studies the exchange of information between the two bilateral relationships and shows that the upstream principal optimally commits to full privacy, whatever price the downstream principal is willing to pay to receive information.

Five lectures on optimal transportation: Geometry, regularity and applications

- Mathematics
- 2010

In this series of lectures we introduce the Monge-Kantorovich problem of optimally transporting one distribution of mass onto another, where optimality is measured against a cost function c(x,y).…

Extreme Points and Majorization: Economic Applications

- Mathematics
- 2020

We characterize the set of extreme points of monotone functions that are either majorized by a given function f or themselves majorize f. Any feasible element in a majorization set can be expressed…