Algorithms for persuasion with limited communication

Keyphrases

• Sender 100%
• Limited Communication 100%
• Optimal Signals 60%
• Signaling Schemes 60%
• Message Space 40%
• Symmetric Distribution 40%
• Optimization Problem 20%
• Polynomial-time Algorithm 20%
• Communication Scheme 20%
• Constant-factor Approximation Algorithm 20%
• NP-hardness 20%
• Hardness of Approximation 20%
• Near-optimal 20%
• Strategic Communication 20%
• Communication Model 20%
• Ignorant 20%
• Independence Assumption 20%
• Rational Agents 20%
• Optimal Communication 20%
• Model Interaction 20%
• Utility Value 20%
• Bayesian Persuasion 20%
• Informed Agents 20%

Mathematics

• Constant Factor 100%
• Symmetric Distribution 100%
• Polynomial Time 50%
• Bayesian 50%
• Independence Assumption 50%
• Marked Contrast 50%
• Rational Agent 50%

Computer Science

• Constant Factor 100%
• Approximation (Algorithm) 50%
• Optimization Problem 50%
• polynomial-time algorithm 50%
• Approximation Algorithms 50%
• Communication Model 50%
• Strategic Communication 50%