Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria

arXiv:2609.22757 · cs.GT, cs.CC, cs.DS, cs.LG · Submitted 2026-09-19 · Read on arXiv

cs.GT, cs.CC, cs.DS, cs.LG

Submitted: 2026-09-19

Updated: 2026-09-19

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regret — 3× in this paper · explained in 3 episodes

Related papers

• Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
• In-Context Credit Assignment via the Core
• Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
• Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
• LLM Bidders Preserve the Mechanism-Level Orderings of Human Bidders
• Towards Performatively Stable Equilibria in Decision-Dependent Games for Arbitrary Data Distribution Maps