Learning to Collude in a Pricing Duopoly

J. Meylahn, A. V. Boer
{"title":"Learning to Collude in a Pricing Duopoly","authors":"J. Meylahn, A. V. Boer","doi":"10.2139/ssrn.3741385","DOIUrl":null,"url":null,"abstract":"Problem definition: This paper addresses the question whether or not self-learning algorithms can learn to collude instead of compete against each other, without violating existing competition law. Academic/practical relevance: This question is practically relevant (and hotly debated) for competition regulators, and academically relevant in the area of analysis of multi-agent data-driven algorithms. Methodology: We construct a price algorithm based on simultaneous-perturbation Kiefer–Wolfowitz recursions. We derive theoretical bounds on its limiting behavior of prices and revenues, in the case that both sellers in a duopoly independently use the algorithm, and in the case that one seller uses the algorithm and the other seller sets prices competitively. Results: We mathematically prove that, if implemented independently by two price-setting firms in a duopoly, prices will converge to those that maximize the firms’ joint revenue in case this is profitable for both firms, and to a competitive equilibrium otherwise. We prove this latter convergence result under the assumption that the firms use a misspecified monopolist demand model, thereby providing evidence for the so-called market-response hypothesis that both firms’ pricing as a monopolist may result in convergence to a competitive equilibrium. If the competitor is not willing to collaborate but prices according to a strategy from a certain class of strategies, we prove that the prices generated by our algorithm converge to a best-response to the competitor’s limit price. Managerial implications: Our algorithm can learn to collude under self-play while simultaneously learn to price competitively against a ‘regular’ competitor, in a setting where the price-demand relation is unknown and within the boundaries of competition law. This demonstrates that algorithmic collusion is a genuine threat in realistic market scenarios. Moreover, our work exemplifies how algorithms can be explicitly designed to learn to collude, and demonstrates that algorithmic collusion is facilitated (a) by the empirically observed practice of (explicitly or implicitly) sharing demand information, and (b) by allowing different firms in a market to use the same price algorithm. These are important and concrete insights for lawmakers and competition policy professionals struggling with how to respond to algorithmic collusion.","PeriodicalId":150569,"journal":{"name":"IO: Theory eJournal","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IO: Theory eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3741385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Problem definition: This paper addresses the question whether or not self-learning algorithms can learn to collude instead of compete against each other, without violating existing competition law. Academic/practical relevance: This question is practically relevant (and hotly debated) for competition regulators, and academically relevant in the area of analysis of multi-agent data-driven algorithms. Methodology: We construct a price algorithm based on simultaneous-perturbation Kiefer–Wolfowitz recursions. We derive theoretical bounds on its limiting behavior of prices and revenues, in the case that both sellers in a duopoly independently use the algorithm, and in the case that one seller uses the algorithm and the other seller sets prices competitively. Results: We mathematically prove that, if implemented independently by two price-setting firms in a duopoly, prices will converge to those that maximize the firms’ joint revenue in case this is profitable for both firms, and to a competitive equilibrium otherwise. We prove this latter convergence result under the assumption that the firms use a misspecified monopolist demand model, thereby providing evidence for the so-called market-response hypothesis that both firms’ pricing as a monopolist may result in convergence to a competitive equilibrium. If the competitor is not willing to collaborate but prices according to a strategy from a certain class of strategies, we prove that the prices generated by our algorithm converge to a best-response to the competitor’s limit price. Managerial implications: Our algorithm can learn to collude under self-play while simultaneously learn to price competitively against a ‘regular’ competitor, in a setting where the price-demand relation is unknown and within the boundaries of competition law. This demonstrates that algorithmic collusion is a genuine threat in realistic market scenarios. Moreover, our work exemplifies how algorithms can be explicitly designed to learn to collude, and demonstrates that algorithmic collusion is facilitated (a) by the empirically observed practice of (explicitly or implicitly) sharing demand information, and (b) by allowing different firms in a market to use the same price algorithm. These are important and concrete insights for lawmakers and competition policy professionals struggling with how to respond to algorithmic collusion.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
学会在定价双头垄断中串通
问题定义:本文解决了自学习算法是否可以在不违反现有竞争法的情况下学会串通而不是相互竞争的问题。学术/实践相关性:这个问题与竞争监管机构的实践相关(并引起了激烈的争论),与多智能体数据驱动算法分析领域的学术相关。方法:我们构建了一个基于同时摄动基弗-沃尔福威茨递归的价格算法。在双寡头垄断中的两个卖家都独立使用该算法,以及一个卖家使用该算法而另一个卖家竞争性地定价的情况下,我们推导了其价格和收入限制行为的理论界限。结果:我们从数学上证明,如果由双寡头垄断中的两个定价公司独立实施,如果这对两个公司都是有利可图的,价格将收敛于使公司联合收入最大化的价格,否则将收敛于竞争均衡。我们在假设两家公司使用了错误的垄断需求模型的情况下证明了后一种收敛结果,从而为所谓的市场反应假设提供了证据,即两家公司作为垄断者的定价可能导致趋同到竞争均衡。如果竞争对手不愿意合作,而是根据某一类策略中的一种策略进行定价,我们证明了算法生成的价格收敛于对竞争对手的极限价格的最佳响应。管理意义:我们的算法可以学习在自我博弈下串通,同时学习在价格需求关系未知的情况下,在竞争法的范围内,对“常规”竞争对手进行有竞争力的定价。这表明,在现实的市场情景中,算法串通是一个真正的威胁。此外,我们的工作举例说明了如何明确设计算法来学习串通,并证明了算法串通是通过(a)经验观察到的(明确或隐含的)共享需求信息的实践,以及(b)允许市场上的不同公司使用相同的价格算法来促进的。对于立法者和竞争政策专业人士来说,这些都是重要而具体的见解,他们正在努力应对算法勾结。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Gainers and Losers from Market Integration Price Authority under Competing Organizations Cash Hedging Motivates Information Sharing in Supply Chains Platform Competition and Interoperability: The Net Fee Model Risks and Global Supply Chains: What We Know and What We Need to Know
×
引用
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