共谋的能力

Daehyun Kim, Rustin Partow
{"title":"共谋的能力","authors":"Daehyun Kim, Rustin Partow","doi":"10.2139/ssrn.3423175","DOIUrl":null,"url":null,"abstract":"It is widely believed that cartels with too many members are destined to fail. The standard argument is that as the number of cartel members increases, shares of collusive profit diminish relative to deviation profits. We show that this argument is built on unreasonable assumptions about plant capacity. We add plant capacity choices to an otherwise standard dynamic oligopoly game, and we analyze the feasibility of a collusive strategy in which each firm chooses plant capacity equal to its static Nash output level, produces an equal share of monopoly output, and uses Nash reversion to punish deviations. Our main results are constructive. We first derive a uniform upper-bound on the minimum discount factor needed for collusion based on the ratio of collusive to monopolistic profits. We then prove that as the number of firms goes to infinity, our collusive strategy profile is an equilibrium as long as the discount factor is below 0.63. Thus, collusion is robust to the number of firms when capacity is chosen pro-collusively. Finally, we use the rho-concavity concept for classifying demand to obtain sharper bounds based on demand primitives.","PeriodicalId":281108,"journal":{"name":"ERPN: Industrial Organization (Topic)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collusive Capacity\",\"authors\":\"Daehyun Kim, Rustin Partow\",\"doi\":\"10.2139/ssrn.3423175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is widely believed that cartels with too many members are destined to fail. The standard argument is that as the number of cartel members increases, shares of collusive profit diminish relative to deviation profits. We show that this argument is built on unreasonable assumptions about plant capacity. We add plant capacity choices to an otherwise standard dynamic oligopoly game, and we analyze the feasibility of a collusive strategy in which each firm chooses plant capacity equal to its static Nash output level, produces an equal share of monopoly output, and uses Nash reversion to punish deviations. Our main results are constructive. We first derive a uniform upper-bound on the minimum discount factor needed for collusion based on the ratio of collusive to monopolistic profits. We then prove that as the number of firms goes to infinity, our collusive strategy profile is an equilibrium as long as the discount factor is below 0.63. Thus, collusion is robust to the number of firms when capacity is chosen pro-collusively. Finally, we use the rho-concavity concept for classifying demand to obtain sharper bounds based on demand primitives.\",\"PeriodicalId\":281108,\"journal\":{\"name\":\"ERPN: Industrial Organization (Topic)\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ERPN: Industrial Organization (Topic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3423175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ERPN: Industrial Organization (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3423175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

人们普遍认为,成员过多的卡特尔注定要失败。标准的论点是,随着卡特尔成员数量的增加,共谋利润的份额相对于偏离利润的份额减少。我们表明,这一论点是建立在对工厂产能的不合理假设之上的。我们将工厂产能选择加入到一个标准的动态寡头博弈中,并分析了一种合谋策略的可行性,在这种策略中,每个企业都选择与其静态纳什产出水平相等的工厂产能,生产同等份额的垄断产出,并使用纳什回归来惩罚偏差。我们的主要成果是建设性的。我们首先根据合谋利润与垄断利润的比值,推导出合谋所需的最小折现系数的统一上界。然后,我们证明了当公司数量趋于无穷大时,只要贴现因子低于0.63,我们的共谋策略轮廓就是均衡的。因此,当产能选择为亲共谋时,共谋对企业数量具有鲁棒性。最后,我们使用rhoo -凹凸性概念对需求进行分类,以获得基于需求原语的更清晰的边界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Collusive Capacity
It is widely believed that cartels with too many members are destined to fail. The standard argument is that as the number of cartel members increases, shares of collusive profit diminish relative to deviation profits. We show that this argument is built on unreasonable assumptions about plant capacity. We add plant capacity choices to an otherwise standard dynamic oligopoly game, and we analyze the feasibility of a collusive strategy in which each firm chooses plant capacity equal to its static Nash output level, produces an equal share of monopoly output, and uses Nash reversion to punish deviations. Our main results are constructive. We first derive a uniform upper-bound on the minimum discount factor needed for collusion based on the ratio of collusive to monopolistic profits. We then prove that as the number of firms goes to infinity, our collusive strategy profile is an equilibrium as long as the discount factor is below 0.63. Thus, collusion is robust to the number of firms when capacity is chosen pro-collusively. Finally, we use the rho-concavity concept for classifying demand to obtain sharper bounds based on demand primitives.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
How Does Price Competition Affect Innovation? Evidence from US Antitrust Cases Usage Lock-In and Platform Competition The Collusive Efficacy of Competition Clauses in Bertrand Markets with Capacity-Constrained Retailers The Conglomerate Network Dissecting Conglomerate Valuations
×
引用
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