Tacit Bidder-Side Collusion: Artificial Intelligence in Dynamic Auctions
Not on the map. Why?
Abstract (arXiv)
We study whether large language models acting as autonomous bidders can tacitly collude by coordinating when to accept platform posted payouts in repeated Dutch auctions, without any communication. We present a minimal repeated auction model that yields a simple incentive compatibility condition and a closed form threshold for sustainable collusion for subgame-perfect Nash equilibria. In controlled simulations with multiple language models, we observe systematic supra-competitive prices in small auction settings and a return to competitive behavior as the number of bidders in the market increases, consistent with the theoretical model. We also find LLMs use various mechanisms to facilitate tacit coordination, such as focal point acceptance timing versus patient strategies that track the theoretical incentives. The results provide, to our knowledge, the first evidence of bidder side tacit collusion by LLMs and show that market structure levers can be more effective than capability limits for mitigation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 43 references that are in the map. First posted on arXiv 26 Nov 2025.
Builds on
8 of 43 references.
References · 8
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2023Evaluating Large Language Models in Theory of Mind Taskscited by 222
- 2023Playing repeated games with Large Language Modelscited by 217
- 2024Secret Collusion among AI Agents: Multi-Agent Deception via Steganographycited by 113
- 2024Algorithmic Collusion by Large Language Modelscited by 62
- 2022Artificial Intelligence and Auction Designcited by 20
- 2023Designing Auctions when Algorithms Learn to Bidcited by 2
Built on by
Not cited yet.