Abstract
A principal faces n agents. The principal truly likes only k <= n of these agents, but wants as many as possible of the agents to believe she truly likes them. The principal communicates with the agents by giving them public “likes, » which are observable by all the agents. We characterize the « liking strategy » that robustly maximizes the sender’s objective function. The model is applied to political campaigns, grade inflation, workplace promotions, and liking on social media.
Partagez cette actualité !