克服协调问题:网络的动态形成

Jack Ochs, In-Uck Park
{"title":"克服协调问题:网络的动态形成","authors":"Jack Ochs, In-Uck Park","doi":"10.2139/ssrn.695321","DOIUrl":null,"url":null,"abstract":"We analyze a multi-period entry game among privately informed agents who differ with respect to the number of agents who must enter in order for their own entry to be profitable. In each period agents who have not yet joined decide whether to subscribe to a network. There exists a unique equilibrium that approximates any symmetric equilibrium arbitrarily closely as the discount factor approaches one. This resolves the coordination problem. Ex-post efficiency is necessarily achieved asymptotically as the population size grows large. These results do not hold if subscribers can reverse their decisions without cost.","PeriodicalId":343564,"journal":{"name":"Economics of Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"Overcoming the Coordination Problem: Dynamic Formation of Networks\",\"authors\":\"Jack Ochs, In-Uck Park\",\"doi\":\"10.2139/ssrn.695321\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze a multi-period entry game among privately informed agents who differ with respect to the number of agents who must enter in order for their own entry to be profitable. In each period agents who have not yet joined decide whether to subscribe to a network. There exists a unique equilibrium that approximates any symmetric equilibrium arbitrarily closely as the discount factor approaches one. This resolves the coordination problem. Ex-post efficiency is necessarily achieved asymptotically as the population size grows large. These results do not hold if subscribers can reverse their decisions without cost.\",\"PeriodicalId\":343564,\"journal\":{\"name\":\"Economics of Networks\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Economics of Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.695321\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Economics of Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.695321","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42

摘要

我们分析了一个多时期的进入博弈,在知情的代理人之间,为了使自己的进入有利可图,他们必须进入的代理人数量不同。在每个周期中,尚未加入的代理决定是否订阅网络。当折现系数趋近于1时,存在一个与任何对称均衡任意接近的唯一均衡。这就解决了协调问题。随着人口规模的增大,事后效率必然是逐渐达到的。如果用户可以免费改变他们的决定,这些结果就不成立了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Overcoming the Coordination Problem: Dynamic Formation of Networks
We analyze a multi-period entry game among privately informed agents who differ with respect to the number of agents who must enter in order for their own entry to be profitable. In each period agents who have not yet joined decide whether to subscribe to a network. There exists a unique equilibrium that approximates any symmetric equilibrium arbitrarily closely as the discount factor approaches one. This resolves the coordination problem. Ex-post efficiency is necessarily achieved asymptotically as the population size grows large. These results do not hold if subscribers can reverse their decisions without cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信