Regulation of Algorithmic Collusion
Not on the map. Why?
Abstract (arXiv)
Consider sellers in a competitive market that use algorithms to adapt their prices from data that they collect. In such a context it is plausible that algorithms could arrive at prices that are higher than the competitive prices and this may benefit sellers at the expense of consumers (i.e., the buyers in the market). This paper gives a definition of plausible algorithmic non-collusion for pricing algorithms. The definition allows a regulator to empirically audit algorithms by applying a statistical test to the data that they collect. Algorithms that are good, i.e., approximately optimize prices to market conditions, can be augmented to contain the data sufficient to pass the audit. Algorithms that have colluded on, e.g., supra-competitive prices cannot pass the audit. The definition allows sellers to possess useful side information that may be correlated with supply and demand and could affect the prices used by good algorithms. The paper provides an analysis of the statistical complexity of such an audit, i.e., how much data is sufficient for the test of non-collusion to be accurate.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Jan 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 4; 2026: 3.
10 papers.
- 2024Algorithmic Collusion by Large Language Modelscited by 62
- 2024Algorithmic Collusion Without Threatscited by 7
- 2024Games with Payments between Learning Agentscited by 3
- 2025Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Gamescited by 3
- 2025Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learnerscited by 1
- 2025Learning from Delayed Feedback in Games via Extra Predictioncited by 1
- 2026Mitigating Retaliatory Algorithmic Collusion in Repeated Gamescited by 1
- 2026Algorithmic Collusion and the Complexity of Information-Value-Free Equilibriacited by 1
- 2025How Market Volatility Shapes Algorithmic Collusion: A Comparative Analysis of Learning-Based Pricing Algorithmscited by 0
- 2026Persistent Partners Raise Prices Among Learning Agentscited by 0
- 2026Persistent Partners Raise Prices Among Learning Agents28 Sep 2026
- 2026Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria19 Sep 2026
- 2026Mitigating Retaliatory Algorithmic Collusion in Repeated Games17 Sep 2026
- 2025How Market Volatility Shapes Algorithmic Collusion: A Comparative Analysis of Learning-Based Pricing Algorithms1 Dec 2025
- 2025Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games3 Nov 2025
- 2025Learning from Delayed Feedback in Games via Extra Prediction26 Sep 2025
- 2025Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners12 Feb 2025
- 2024Algorithmic Collusion Without Threats6 Sep 2024
- 2024Games with Payments between Learning Agents31 May 2024
- 2024Algorithmic Collusion by Large Language Models31 Mar 2024