{"title":"On the difficulty of characterizing network formation with endogenous behavior","authors":"Benjamin Golub , Yu-Chi Hsieh , Evan Sadler","doi":"10.1016/j.mathsocsci.2023.10.006","DOIUrl":null,"url":null,"abstract":"<div><p><span>Bolletta (2021)</span> studies a model in which a network is strategically formed and then agents play a linear best-response investment game in it. The model is motivated by an application in which people choose both their study partners and their levels of educational effort. Agents have different one-dimensional types – private returns to effort. A main result claims that (pairwise Nash) stable networks have a <em>locally complete</em><span><span> structure consisting of possibly overlapping cliques: if two agents are linked, they are part of a clique composed of all agents with types between theirs. A </span>counterexample shows that the claimed characterization is incorrect. We specify where the analysis errs and discuss implications for network formation models.</span></p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 107-110"},"PeriodicalIF":0.5000,"publicationDate":"2024-05-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/S0165489623000884","RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0
Abstract
Bolletta (2021) studies a model in which a network is strategically formed and then agents play a linear best-response investment game in it. The model is motivated by an application in which people choose both their study partners and their levels of educational effort. Agents have different one-dimensional types – private returns to effort. A main result claims that (pairwise Nash) stable networks have a locally complete structure consisting of possibly overlapping cliques: if two agents are linked, they are part of a clique composed of all agents with types between theirs. A counterexample shows that the claimed characterization is incorrect. We specify where the analysis errs and discuss implications for network formation models.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
