Open Access
Algorithmic collusion, genuine and spurious
Loading...
Files
Calvano et al. 2021_Genuine_Spurious.pdf (274.83 KB)
Full-text in Open Access
License
Cadmus Permanent Link
Full-text via DOI
ISBN
ISSN
Issue Date
Type of Publication
Keyword(s)
LC Subject Heading
Other Topic(s)
EUI Research Cluster(s)
Initial version
Published version
Succeeding version
Preceding version
Published version part
Earlier different version
Initial format
Citation
CEPR Discussion Papers; 2020/16393
Cite
CALVANO, Emilio, CALZOLARI, Giacomo, DENICOLÒ, Vincenzo, PASTORELLO, Sergio, Algorithmic collusion, genuine and spurious, CEPR Discussion Papers, 2020/16393 - https://hdl.handle.net/1814/73728
Abstract
We clarify the difference between the asynchronous pricing algorithms analyzed by Asker, Fershtman and Pakes (2021) and those considered in the previous literature. The difference lies in the way the algorithms explore: randomly or mechanically. We reaffirm that with random exploration, asynchronous pricing algorithms learn genuinely collusive strategies.