Asymptotic Full Revelation in Cheap Talk with Large Number of Senders

2014 ◽  
Author(s):  
Oleg Rubanov
Keyword(s):  
Cheap Talk ◽  
Full Revelation

scholarly journals Robustness of full revelation in multisender cheap talk

2019 ◽  
Vol 14 (4) ◽  
pp. 1203-1235 ◽  
Author(s):  
Margaret Meyer ◽  
Inés Moreno de Barreda ◽  
Julia Nafziger
Keyword(s):  
Information Transmission ◽  
Cheap Talk ◽  
Geometric Condition ◽  
Policy Space ◽  
Policy Rule ◽  
Small Deviations ◽  
Specific Policy ◽  
Necessary And Sufficient ◽  
Fully Revealing Equilibrium ◽  
Full Revelation

This paper studies information transmission in a two‐sender, multidimensional cheap talk setting where there are exogenous constraints on the (convex) feasible set of policies for the receiver, and where the receiver is uncertain about both the directions and the magnitudes of the senders' bias vectors. With the supports of the biases represented by cones, we prove that whenever there exists an equilibrium that fully reveals the state, there exists a robust fully revealing equilibrium (FRE), i.e., one in which small deviations result in only small punishments. We provide a geometric condition—the local deterrence condition—that relates the cones of the biases to the frontier of the policy space, which is necessary and sufficient for the existence of a FRE. We also construct a specific policy rule for the receiver—the min rule—that supports a robust FRE whenever one exists.

Confiance, réciprocité et cheap talk

1999 ◽  
Vol 50 (1) ◽  
pp. 5-44
Author(s):  
Claude Meidinger ◽  
Stéphane Robin ◽  
Bernard Ruffieux
Keyword(s):  
Cheap Talk

The Effect of Continuous-Time Cheap Talk in the Experimental Minimum Effort Game

2019 ◽  
Author(s):  
Hisashi Toku ◽  
Tatsuhiro Shichijo ◽  
Kazuhito Ogawa
Keyword(s):  
Continuous Time ◽  
Cheap Talk
Sign in / Sign up

Export Citation Format

Share Document