内生性社会网络中的交流动态

K. Bimpikis, D. Acemoglu, A. Ozdaglar
{"title":"内生性社会网络中的交流动态","authors":"K. Bimpikis, D. Acemoglu, A. Ozdaglar","doi":"10.1145/1807406.1807499","DOIUrl":null,"url":null,"abstract":"We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An underlying state (of the world) determines which action has higher payoff. Agents decide which agents to form a communication link with incurring the associated cost and receive a private signal correlated with the underlying state. They then exchange information over the induced communication network until taking an (irreversible) action. We define asymptotic learning as the fraction of agents taking the correct action converging to one in probability as a society grows large. Under truthful communication, we show that asymptotic learning occurs if (and under some additional conditions, also only if) in the induced communication network most agents are a short distance away from \"information hubs\", which receive and distribute a large amount of information. Asymptotic learning therefore requires information to be aggregated in the hands of a few agents. We then provide a systematic investigation of what types of cost structures and associated social cliques (consisting of groups of individuals linked to each other at zero cost, such as friendship networks) ensure the emergence of communication networks that lead to asymptotic learning. Finally, we show how these results can be applied to several commonly studied random graph models, such as preferential attachment and Erdos-Renyi graphs.","PeriodicalId":142982,"journal":{"name":"Behavioral and Quantitative Game Theory","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Communication dynamics in endogenous social networks\",\"authors\":\"K. Bimpikis, D. Acemoglu, A. Ozdaglar\",\"doi\":\"10.1145/1807406.1807499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An underlying state (of the world) determines which action has higher payoff. Agents decide which agents to form a communication link with incurring the associated cost and receive a private signal correlated with the underlying state. They then exchange information over the induced communication network until taking an (irreversible) action. We define asymptotic learning as the fraction of agents taking the correct action converging to one in probability as a society grows large. Under truthful communication, we show that asymptotic learning occurs if (and under some additional conditions, also only if) in the induced communication network most agents are a short distance away from \\\"information hubs\\\", which receive and distribute a large amount of information. Asymptotic learning therefore requires information to be aggregated in the hands of a few agents. We then provide a systematic investigation of what types of cost structures and associated social cliques (consisting of groups of individuals linked to each other at zero cost, such as friendship networks) ensure the emergence of communication networks that lead to asymptotic learning. Finally, we show how these results can be applied to several commonly studied random graph models, such as preferential attachment and Erdos-Renyi graphs.\",\"PeriodicalId\":142982,\"journal\":{\"name\":\"Behavioral and Quantitative Game Theory\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Behavioral and Quantitative Game Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1807406.1807499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Behavioral and Quantitative Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1807406.1807499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

我们开发了一个通过沟通进行信息交换的模型,并研究了它对大型社会中信息聚集的影响。(游戏世界的)潜在状态决定了哪种行为具有更高的收益。代理决定与哪些代理形成通信链接,从而产生相关的成本,并接收与底层状态相关的私有信号。然后它们通过诱导的通信网络交换信息,直到采取(不可逆的)行动。我们将渐近学习定义为随着社会规模的扩大,采取正确行动的智能体的比例在概率上收敛为1。在真实通信条件下,我们发现当(在一些附加条件下,也仅当)在诱导通信网络中,大多数智能体距离接收和分发大量信息的“信息中心”很近时才会发生渐近学习。因此,渐近学习要求信息集中在几个代理的手中。然后,我们对哪种类型的成本结构和相关的社会集团(由以零成本相互联系的个人群体组成,例如友谊网络)确保导致渐近学习的通信网络的出现进行了系统的调查。最后,我们展示了如何将这些结果应用于几种常用的随机图模型,如优先依恋和Erdos-Renyi图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Communication dynamics in endogenous social networks
We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An underlying state (of the world) determines which action has higher payoff. Agents decide which agents to form a communication link with incurring the associated cost and receive a private signal correlated with the underlying state. They then exchange information over the induced communication network until taking an (irreversible) action. We define asymptotic learning as the fraction of agents taking the correct action converging to one in probability as a society grows large. Under truthful communication, we show that asymptotic learning occurs if (and under some additional conditions, also only if) in the induced communication network most agents are a short distance away from "information hubs", which receive and distribute a large amount of information. Asymptotic learning therefore requires information to be aggregated in the hands of a few agents. We then provide a systematic investigation of what types of cost structures and associated social cliques (consisting of groups of individuals linked to each other at zero cost, such as friendship networks) ensure the emergence of communication networks that lead to asymptotic learning. Finally, we show how these results can be applied to several commonly studied random graph models, such as preferential attachment and Erdos-Renyi graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Game theory and operations management Cost sharing in distribution problems for franchise operations Subgame-perfection in positive recursive games Rationalizability, adaptive dynamics, and the correspondence principle in games with strategic substitutes Structural estimation of discrete-choice games of incomplete information with multiple equilibria
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1