Robust Communication Between Parties with Nearly Independent Preferences
We study finite-state communication games in which the sender's preference is perturbed by random private idiosyncrasies. Persuasion is generically impossible within the class of statistically independent sender/receiver preferences -- contrary to prior research establishing persuasive equilibria when the sender's preference is precisely transparent. Nevertheless, robust persuasion may occur when the sender's preference is only slightly state-dependent/idiosyncratic. This requires approximating an acyclic' equilibrium of the transparent preference game, generically implying that this equilibrium is also connected' -- a generalization of partial-pooling equilibria. It is then necessary and sufficient that the sender's preference satisfy a monotonicity condition relative to the approximated equilibrium. If the sender's preference further satisfies a `semi-local' version of increasing differences, then this analysis extends to sender preferences that rank pure actions (but not mixed actions) according to a state-independent order. We apply these techniques to study (1) how ethical considerations, such as empathy for the receiver, may improve or impede comm
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
POSEIDON: Privacy-Preserving Federated Neural Network Learning
In this paper, we address the problem of privacy-preserving training and evaluation of neural networks in an $N$-party, federated learning setting. We propose a novel system, POSEIDON, the first of its kind in the regime…
Federated LearningPrivacy PreservingCommunication-Efficient and Privacy-Adaptable Mechanism -- a Federated Learning Scheme with Convergence Analysis
Federated learning enables multiple parties to jointly train learning models without sharing their own underlying data, offering a practical pathway to privacy-preserving collaboration under data-governance constraints. …
Federated LearningCoresets for Vertical Federated Learning: Regularized Linear Regression and $K$-Means Clustering
Vertical federated learning (VFL), where data features are stored in multiple parties distributively, is an important area in machine learning. However, the communication complexity for VFL is typically very high. In thi…
ClusteringFederated LearningregressionVertical Federated LearningAn Accurate, Scalable and Verifiable Protocol for Federated Differentially Private Averaging
Learning from data owned by several parties, as in federated learning, raises challenges regarding the privacy guarantees provided to participants and the correctness of the computation in the presence of malicious parti…
Federated LearningEcho Chambers: Voter-to-Voter Communication and Political Competition
I study how strategic communication among voters shapes both political outcomes and parties' advertising strategies in a model of informative campaign advertising. Two main results are derived. First, echo chambers arise…