Clarification of `Algorithmic Collusion without Threats'
Jason Hartline

TL;DR
This paper clarifies that a previous scenario labeled as 'algorithmic collusion without threats' is actually a case of non-competitive behavior by one player and competitive behavior by another, not true collusion.
Contribution
It corrects a misinterpretation in prior work by clarifying the nature of the strategic behaviors involved.
Findings
The scenario is not collusion but asymmetric strategic behavior.
Clarification impacts the interpretation of algorithmic interactions.
Revises understanding of competitive vs. non-competitive behaviors.
Abstract
This brief note clarifies that the scenario described in Arunachaleswaran et al. (2025) -- titled `Algorithmic Collusion without Threats' -- is not one of collusion, but one where one player is behaving non-competitively and the other is behaving competitively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Artificial Intelligence in Games · Optimization and Search Problems
