{"title":"观察学习下的最佳影响力","authors":"Nikolas Tsakas","doi":"10.1016/j.mathsocsci.2024.01.011","DOIUrl":null,"url":null,"abstract":"<div><p>We study the optimal targeting problem of a firm that is seeking to maximize the diffusion of a product in a society where agents learn from their neighbors. The firm can seed the product to a subset of the population and our goal is to find which the optimal subset to target is. We provide a condition that characterizes the optimal targeting strategy for any network structure. The key parameter in this condition is the agents’ decay centrality, which takes into account how close an agent is to others, in a way that distant agents are weighted less than closer ones.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"128 ","pages":"Pages 41-51"},"PeriodicalIF":0.5000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal influence under observational learning\",\"authors\":\"Nikolas Tsakas\",\"doi\":\"10.1016/j.mathsocsci.2024.01.011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We study the optimal targeting problem of a firm that is seeking to maximize the diffusion of a product in a society where agents learn from their neighbors. The firm can seed the product to a subset of the population and our goal is to find which the optimal subset to target is. We provide a condition that characterizes the optimal targeting strategy for any network structure. The key parameter in this condition is the agents’ decay centrality, which takes into account how close an agent is to others, in a way that distant agents are weighted less than closer ones.</p></div>\",\"PeriodicalId\":51118,\"journal\":{\"name\":\"Mathematical Social Sciences\",\"volume\":\"128 \",\"pages\":\"Pages 41-51\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Social Sciences\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0165489624000209\",\"RegionNum\":4,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Social Sciences","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0165489624000209","RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
We study the optimal targeting problem of a firm that is seeking to maximize the diffusion of a product in a society where agents learn from their neighbors. The firm can seed the product to a subset of the population and our goal is to find which the optimal subset to target is. We provide a condition that characterizes the optimal targeting strategy for any network structure. The key parameter in this condition is the agents’ decay centrality, which takes into account how close an agent is to others, in a way that distant agents are weighted less than closer ones.
期刊介绍:
The international, interdisciplinary journal Mathematical Social Sciences publishes original research articles, survey papers, short notes and book reviews. The journal emphasizes the unity of mathematical modelling in economics, psychology, political sciences, sociology and other social sciences.
Topics of particular interest include the fundamental aspects of choice, information, and preferences (decision science) and of interaction (game theory and economic theory), the measurement of utility, welfare and inequality, the formal theories of justice and implementation, voting rules, cooperative games, fair division, cost allocation, bargaining, matching, social networks, and evolutionary and other dynamics models.
Papers published by the journal are mathematically rigorous but no bounds, from above or from below, limits their technical level. All mathematical techniques may be used. The articles should be self-contained and readable by social scientists trained in mathematics.