mlsanityData to 7 Oct 2026

The Spoils of Algorithmic Collusion: Profit Allocation Among Asymmetric Firms

arXiv 2501.07178 ↗First posted 13 Jan 2025econ.GN cs.AI q-fin.ECcited by 0

Not on the map. Why?

Abstract (arXiv)

We study the propensity of independent algorithms to collude in repeated Cournot duopoly games. Specifically, we investigate the predictive power of different oligopoly and bargaining solutions regarding the effect of asymmetry between firms. We find that both consumers and firms can benefit from asymmetry. Algorithms produce more competitive outcomes when firms are symmetric, but less when they are very asymmetric. Although the static Nash equilibrium underestimates the effect on total quantity and overestimates the effect on profits, it delivers surprisingly accurate predictions in terms of total welfare. The best description of our results is provided by the equal relative gains solution. In particular, we find algorithms to agree on profits that are on or close to the Pareto frontier for all degrees of asymmetry. Our results suggest that the common belief that symmetric industries are more prone to collusion may no longer hold when algorithms increasingly drive managerial decisions.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 61 references that are in the map. First posted on arXiv 13 Jan 2025.

Builds on

3 of 61 references.

References · 3

  1. 2021Reinforcement Learning for Ridesharing: An Extended Surveycited by 35
  2. 2022Deep Inventory Managementcited by 22
  3. 2022Using Non-Stationary Bandits for Learning in Repeated Cournot Games with Non-Stationary Demandcited by 2

Built on by

Not cited yet.