Autonomous algorithmic collusion: Q‐learning under sequential pricing

Timo Klein

RAND Journal of Economics, 2021, vol. 52, issue 3, 538-558

Abstract: Prices are increasingly set by algorithms. One concern is that intelligent algorithms may learn to collude on higher prices even in the absence of the kind of coordination necessary to establish an antitrust infringement. However, exactly how this may happen is an open question. I show how in simulated sequential competition, competing reinforcement learning algorithms can indeed learn to converge to collusive equilibria when the set of discrete prices is limited. When this set increases, the algorithm considered increasingly converges to supra‐competitive asymmetric cycles. I show that results are robust to various extensions and discuss practical limitations and policy implications.

Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (31)

Downloads: (external link)
https://doi.org/10.1111/1756-2171.12383

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:bla:randje:v:52:y:2021:i:3:p:538-558

Ordering information: This journal article can be ordered from
http://www.blackwell ... al.asp?ref=0741-6261

Access Statistics for this article

RAND Journal of Economics is currently edited by James Hosek

More articles in RAND Journal of Economics from RAND Corporation Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().