Frontiers: Algorithmic Collusion: Supra-competitive Prices via Independent Algorithms

被引:25
|
作者
Hansen, Karsten T. [1 ]
Misra, Kanishka [1 ]
Pai, Mallesh M. [2 ]
机构
[1] Univ Calif San Diego, Rady Sch Management, La Jolla, CA 92093 USA
[2] Rice Univ, Dept Econ, Houston, TX 77005 USA
基金
美国国家科学基金会;
关键词
algorithmic pricing; collusion; behavioral game theory; BANDIT; REGRET;
D O I
10.1287/mksc.2020.1276
中图分类号
F [经济];
学科分类号
02 ;
摘要
Motivated by their increasing prevalence, we study outcomes when competing sellers use machine learning algorithms to run real-time dynamic price experiments. These algorithms are often misspecified, ignoring the effect of factors outside their control, for example, competitors' prices. We show that the long-run prices depend on the informational value (or signal-to-noise ratio) of price experiments: if low, the long-run prices are consistent with the static Nash equilibrium of the corresponding full information setting. However, if high, the long-run prices are supra-competitive-the full information joint monopoly outcome is possible. We show that this occurs via a novel channel: competitors' algorithms' prices end up running correlated experiments. Therefore, sellers' misspecified models overestimate the own price sensitivity, resulting in higher prices. We discuss the implications on competition policy.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 1 条
  • [1] Collusion by mistake: Does algorithmic sophistication drive supra-competitive profits?
    Abada, Ibrahim
    Lambin, Xavier
    Tchakarov, Nikolay
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (03) : 927 - 953