| dc.contributor.author | CALVANO, Emilio | |
| dc.contributor.author | CALZOLARI, Giacomo | |
| dc.contributor.author | DENICOLÒ, Vincenzo | |
| dc.contributor.author | PASTORELLO, Sergio | |
| dc.date.accessioned | 2022-01-21T09:45:25Z | |
| dc.date.available | 2022-01-21T09:45:25Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | https://hdl.handle.net/1814/73728 | |
| dc.description.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. | en |
| dc.format.mimetype | application/pdf | en |
| dc.language.iso | en | en |
| dc.publisher | CEPR | en |
| dc.relation.ispartofseries | CEPR Discussion Papers | en |
| dc.relation.ispartofseries | 2020/16393 | en |
| dc.rights | info:eu-repo/semantics/openAccess | en |
| dc.title | Algorithmic collusion, genuine and spurious | en |
| dc.type | Working Paper | en |
| eui.subscribe.skip | true | |
