Abstract
The possibility of algorithmic collusion between pricing algorithms and the necessary antitrust legislation to regulate against it are hotly debated among academics and policymakers. However, none of the algorithms shown to collude have theoretical convergence guarantees and no theoretical framework exists for characterizing an algorithm's likelihood to collude. In this article, we summarize recent work which provides tools for quantifying the likelihood of collusion for a provably convergent algorithm and applies the results to two simple pricing environments.
| Original language | English |
|---|---|
| Number of pages | 11 |
| Publication status | Published - 1 Aug 2024 |
| Event | 17th European Workshop on Reinforcement Learning, EWRL 2024 - Université Toulouse 1 Capitole, Toulouse, France Duration: 28 Oct 2024 → 30 Oct 2024 Conference number: 17 https://ewrl.wordpress.com/ewrl17-2024/ |
Conference
| Conference | 17th European Workshop on Reinforcement Learning, EWRL 2024 |
|---|---|
| Abbreviated title | EWRL 2024 |
| Country/Territory | France |
| City | Toulouse |
| Period | 28/10/24 → 30/10/24 |
| Internet address |