Mediated Cheap Talk Design (with proofs)

11/26/2022
by   Itai Arieli, et al.
0

We study an information design problem with two informed senders and a receiver in which, in contrast to traditional Bayesian persuasion settings, senders do not have commitment power. In our setting, a trusted mediator/platform gathers data from the senders and recommends the receiver which action to play. We characterize the set of implementable action distributions that can be obtained in equilibrium, and provide an O(n log n) algorithm (where n is the number of states) that computes the optimal equilibrium for the senders. Additionally, we show that the optimal equilibrium for the receiver can be obtained by a simple revelation mechanism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2023

Informationally Robust Cheap-Talk

We study the robustness of cheap-talk equilibria to infinitesimal privat...
research
07/11/2023

Resilient Information Aggregation

In an information aggregation game, a set of senders interact with a rec...
research
02/02/2023

Signaling Games with Costly Monitoring

If in a signaling game the receiver expects to gain no information by mo...
research
01/04/2022

Mechanism Design with Informational Punishment

We introduce informational punishment to the design of mechanisms that c...
research
07/22/2019

Optimal Hierarchical Signaling for Quadratic Cost Measures and General Distributions: A Copositive Program Characterization

In this paper, we address the problem of optimal hierarchical signaling ...
research
05/26/2022

Communicating with Anecdotes

We study a communication game between a sender and receiver where the se...
research
09/08/2022

Sequential Information Design: Learning to Persuade in the Dark

We study a repeated information design problem faced by an informed send...

Please sign up or login with your details

Forgot password? Click here to reset