mlsanityData to 14 Oct 2026

Beyond Supra-Competitive Outcomes: Collusive Behaviour in Deep Reinforcement Learning for Optimal Execution Games

arXiv 2610.00619 ↗First posted 30 Sep 2026q-fin.TR cs.AIcited by 0

On the map: Deep reinforcement learning methods → Adversarial robustness and RL in finance

Abstract (arXiv)

In this paper, we extend earlier findings of supra-competitive outcomes in optimal-execution games by identifying a learned punitive mechanism that deters deviations and provides behavioural evidence of collusion. We investigate this mechanism in a two-player, finite-horizon Almgren-Chriss liquidation game. Independent proximal policy optimisation agents with access to within-episode price and action histories achieve costs below the Nash benchmark. We identify a profitable deviation by training against the mean learned liquidation schedule, then impose its first trade on one of the original agents. The opponent responds by accelerating liquidation. This response more than offsets the deviator's gain in every run and both player roles, while leaving the punisher's average payoff materially unchanged relative to not punishing under the same deviation. The punisher imposes greater losses on the deviator while preserving its own average payoff, despite the availability of more profitable, less punitive liquidation plans. Matching deviations and subsequent additional selling rise and later decline during training, while final policies retain an effective punitive response. We formalise two checks: whether punishment outweighs the gain from deviating, and whether the change in trading behaviour is large enough to account for the loss imposed. Both checks hold for the tested deviation. Together, these findings provide behavioural and economic evidence supporting a collusive interpretation of the learned supra-competitive outcomes.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Adversarial robustness and RL in finance, one of 15 directions in Deep reinforcement learning methods. Builds on 8 of its 23 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

8 of 23 references.

Closest ancestors · 2

Same direction, newest first

  1. 2026Memory-Induced Supra-Competitive Outcomes Between Deep Reinforcement Learning Agents in Optimal Trade Execution19 May
  2. 2024Deviations from the Nash equilibrium in a two-player optimal execution game with reinforcement learning21 Aug

Other references · 6

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2018Double Deep Q-Learning for Optimal Executioncited by 43
  3. 2013A state-constrained differential game arising in optimal portfolio liquidationcited by 3
  4. 2023Self-Play Q-learners Can Provably Collude in the Iterated Prisoner's Dilemmacited by 3
  5. 2026AI agents in Algorithmic Electricity Markets: On the Emergence of Tacit Collusioncited by 1
  6. 2026Mitigating Retaliatory Algorithmic Collusion in Repeated Gamescited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Learning to Charge More: A Theoretical Study of Collusion by Q-Learning Agents
  2. 2024Learning Collusion in Episodic, Inventory-Constrained Markets ↗
  3. 2026Prompt Optimization Enables Stable Algorithmic Collusion in LLM Agents
  4. 2026Domination-Avoiding Learning Agents Cannot Collude ↗
  5. 2026When a Correct Reward Is Not Enough: Diagnosing and Guiding PPO in an Analytically Solved Broker-Trader Game
  6. 2026Zero Collapse: A Failure Mode of Policy Gradient Methods in Discontinuous Reward Environments
  7. 2024Decoding fairness: a reinforcement learning perspective
  8. 2024By Fair Means or Foul: Quantifying Collusion in a Market Simulation with Deep Reinforcement Learning