说服
通信源
班级(哲学)
计算机科学
排名(信息检索)
贝叶斯概率
概率逻辑
推论
贝叶斯推理
钥匙(锁)
人工智能
贝叶斯网络
机器学习
心理学
计算机安全
社会心理学
电信
作者
Geoffroy de Clippel,Xu Zhang
摘要
Following Kamenica and Gentzkow, this paper studies persuasion as an information design problem. We investigate how mistakes in probabilistic inference impact optimal persuasion. The concavification method is shown to extend naturally to a large class of belief updating rules, which we identify and characterize. This class comprises many non-Bayesian models discussed in the literature. We apply this new technique to gain insight into the revelation principle, the ranking of updating rules, when persuasion is beneficial to the sender, and when it is detrimental to the receiver. Our key result also extends to shed light on the question of robust persuasion.
科研通智能强力驱动
Strongly Powered by AbleSci AI