Exploiting social influence in networks

Theoretical Economics, 2024

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.3982/te5068
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

We study binary action network games with strategic complementarities. An agent acts if the aggregate social influence of her friends exceeds a transfer levied on the agent by a principal. The principal seeks to maximize her revenue while inducing everyone to act in a unique equilibrium. We characterize optimal transfers showing that agents who are more popular than their friends receive preferential treatment. Our main result is that under mild conditions complete core‐periphery networks deliver the highest revenue to the principal. Furthermore, we show that the revenue is higher in networks where links are allocated unequally across agents. Hence, the principal benefits from creating “influentials” by linking well‐connected hubs to less popular periphery.