Likes

1 Pages Posted: 17 Aug 2024

See all articles by Tuval Danenberg

Tuval Danenberg

Massachusetts Institute of Technology (MIT)

Zvika Neeman

Tel Aviv University - Eitan Berglas School of Economics

Daniel Spiro

Uppsala University

Multiple version iconThere are 3 versions of this paper

Abstract

A sender faces $n$ receivers. She privately favors a subset of these receivers but wants as many receivers as possible to believe they are favored. To communicate, the sender uses public ``likes." We characterize the ``liking strategies" that can be sustained in a robust equilibrium and show that they must involve a fixed and constant number of likes. Additionally, we describe conditions for when monotone liking strategies can and cannot be sustained as an equilibrium, regardless of robustness. We apply the model to workplace promotion promises, grade inflation, political campaigns, and liking on social media.

Keywords: cheap-talk, multiple receivers, communication game, promises.

Suggested Citation

Danenberg, Tuval and Neeman, Zvika and Spiro, Daniel, Likes. Available at SSRN: https://ssrn.com/abstract=4928940

Tuval Danenberg

Massachusetts Institute of Technology (MIT) ( email )

77 Massachusetts Avenue
50 Memorial Drive
Cambridge, MA 02139-4307
United States

Zvika Neeman (Contact Author)

Tel Aviv University - Eitan Berglas School of Economics ( email )

P.O. Box 39040
Ramat Aviv, Tel Aviv, 69978
Israel

HOME PAGE: http://www.tau.ac.il/~zvika/

Daniel Spiro

Uppsala University ( email )

Box 513
Uppsala, 751 20
Sweden

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
16
Abstract Views
100
PlumX Metrics