EconPapers    
Economics at your fingertips  
 

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

Ibrahim Abada, Xavier Lambin and Nikolay Tchakarov

European Journal of Operational Research, 2024, vol. 318, issue 3, 927-953

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.

Keywords: Algorithmic decision-making; Delegated decisions; Machine learning; Multi-agent reinforcement learning; Tacit collusion (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722172400434X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:318:y:2024:i:3:p:927-953

DOI: 10.1016/j.ejor.2024.06.006

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:ejores:v:318:y:2024:i:3:p:927-953