IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v24y2022i5p2577-2594.html
   My bibliography  Save this article

Learning to Collude in a Pricing Duopoly

Author

Listed:
  • Janusz M. Meylahn

    (Dutch Institute of Emergent Phenomena, Korteweg-de Vries Institute for Mathematics, Informatics Institute, and Amsterdam Business School, University of Amsterdam, 1012 WX Amsterdam, Netherlands)

  • Arnoud V. den Boer

    (Korteweg-de Vries Instituut and Amsterdam Business School, University of Amsterdam, 1012 WX Amsterdam, Netherlands)

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.

Suggested Citation

  • Janusz M. Meylahn & Arnoud V. den Boer, 2022. "Learning to Collude in a Pricing Duopoly," Manufacturing & Service Operations Management, INFORMS, vol. 24(5), pages 2577-2594, September.
  • Handle: RePEc:inm:ormsom:v:24:y:2022:i:5:p:2577-2594
    DOI: 10.1287/msom.2021.1074
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.1074
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.1074?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:24:y:2022:i:5:p:2577-2594. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.