Persuasion by Dimension Reduction

10/17/2021
by   Semyon Malamud, et al.
0

How should an agent (the sender) observing multi-dimensional data (the state vector) persuade another agent to take the desired action? We show that it is always optimal for the sender to perform a (non-linear) dimension reduction by projecting the state vector onto a lower-dimensional object that we call the "optimal information manifold." We characterize geometric properties of this manifold and link them to the sender's preferences. Optimal policy splits information into "good" and "bad" components. When the sender's marginal utility is linear, revealing the full magnitude of good information is always optimal. In contrast, with concave marginal utility, optimal information design conceals the extreme realizations of good information and only reveals its direction (sign). We illustrate these effects by explicitly solving several multi-dimensional Bayesian persuasion problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2023

Non-linear dimension reduction in factor-augmented vector autoregressions

This paper introduces non-linear dimension reduction in factor-augmented...
research
03/11/2021

Modern Dimension Reduction

Data are not only ubiquitous in society, but are increasingly complex bo...
research
07/29/2011

A Invertible Dimension Reduction of Curves on a Manifold

In this paper, we propose a novel lower dimensional representation of a ...
research
06/22/2016

Manifold Approximation by Moving Least-Squares Projection (MMLS)

In order to avoid the curse of dimensionality, frequently encountered in...
research
10/21/2021

Autonomous Dimension Reduction by Flattening Deformation of Data Manifold under an Intrinsic Deforming Field

A new dimension reduction (DR) method for data sets is proposed by auton...
research
05/22/2020

Rdimtools: An R package for Dimension Reduction and Intrinsic Dimension Estimation

Discovering patterns of the complex high-dimensional data is a long-stan...
research
08/22/2023

Data Assimilation for Sign-indefinite Priors: A generalization of Sinkhorn's algorithm

The purpose of this work is to develop a framework to calibrate signed d...

Please sign up or login with your details

Forgot password? Click here to reset