English

On the Fragility of AI Agent Collusion

Computer Science and Game Theory 2026-03-24 v1 Artificial Intelligence

Abstract

Recent work shows that pricing with symmetric LLM agents leads to algorithmic collusion. We show that collusion is fragile under the heterogeneity typical of real deployments. In a stylized repeated-pricing model, heterogeneity in patience or data access reduces the set of collusive equilibria. Experiments with open-source LLM agents (totaling over 2,000 compute hours) align with these predictions: patience heterogeneity reduces price lift from 22% to 10% above competitive levels; asymmetric data access, to 7%. Increasing the number of competing LLMs breaks up collusion; so does cross-algorithm heterogeneity, that is, setting LLMs against Q-learning agents. But model-size differences (e.g., 32B vs. 14B weights) do not; they generate leader-follower dynamics that stabilize collusion. We discuss antitrust implications, such as enforcement actions restricting data-sharing and policies promoting algorithmic diversity.

Keywords

Cite

@article{arxiv.2603.20281,
  title  = {On the Fragility of AI Agent Collusion},
  author = {Jussi Keppo and Yuze Li and Gerry Tsoukalas and Nuo Yuan},
  journal= {arXiv preprint arXiv:2603.20281},
  year   = {2026}
}

Comments

48 pages, 7 figures, 8 tables (including appendix)