IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v318y2024i3p927-953.html
   My bibliography  Save this article

Collusion by mistake: Does algorithmic sophistication drive supra-competitive profits?

Author

Listed:
  • Abada, Ibrahim
  • Lambin, Xavier
  • Tchakarov, Nikolay

Abstract

A burgeoning literature shows that self-learning algorithms may, under some conditions, reach seemingly-collusive outcomes: after repeated interaction, competing algorithms earn supra-competitive profits, at the expense of efficiency and consumer welfare. This paper offers evidence that such behavior can stem from insufficient exploration during the learning process and that algorithmic sophistication might increase competition. In particular, we show that allowing for more thorough exploration does lead otherwise seemingly-collusive Q-learning algorithms to play more competitively. We first provide a theoretical illustration of this phenomenon by analyzing the competition between two stylized Q-learning algorithms in a Prisoner’s Dilemma framework. Second, via simulations, we show that some more sophisticated algorithms exploit the seemingly-collusive ones. Following these results, we argue that the advancement of algorithms in sophistication and computational capabilities may, in some situations, provide a solution to the challenge of algorithmic seeming collusion, rather than exacerbate it.

Suggested Citation

  • Abada, Ibrahim & Lambin, Xavier & Tchakarov, Nikolay, 2024. "Collusion by mistake: Does algorithmic sophistication drive supra-competitive profits?," European Journal of Operational Research, Elsevier, vol. 318(3), pages 927-953.
  • Handle: RePEc:eee:ejores:v:318:y:2024:i:3:p:927-953
    DOI: 10.1016/j.ejor.2024.06.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172400434X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.06.006?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eshwar Ram Arunachaleswaran & Natalie Collina & Sampath Kannan & Aaron Roth & Juba Ziani, 2024. "Algorithmic Collusion Without Threats," Papers 2409.03956, arXiv.org.

    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:eee:ejores:v:318:y:2024:i:3:p:927-953. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.