Exploiting social influence in networks
Vladyslav Nora (vladyslav.nora@nu.edu.kz) and
Eyal Winter (eyal.winter@mail.huji.ac.il)
Additional contact information
Vladyslav Nora: Department of Economics, Nazarbayev University
Eyal Winter: The Federmann Center for the Study of Rationality, Hebrew University
Theoretical Economics, 2024, vol. 19, issue 1
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.
Keywords: Social networks; unique implementation; strategic complementarities; split graphs (search for similar items in EconPapers)
JEL-codes: C72 D82 (search for similar items in EconPapers)
Date: 2024-01-26
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://econtheory.org/ojs/index.php/te/article/viewFile/20240001/38397/1156 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:the:publsh:5068
Access Statistics for this article
Theoretical Economics is currently edited by Simon Board, Todd D. Sarver, Juuso Toikka, Rakesh Vohra, Pierre-Olivier Weill
More articles in Theoretical Economics from Econometric Society
Bibliographic data for series maintained by Martin J. Osborne (martin.osborne@utoronto.ca).