Deviations from the Nash equilibrium in a two-player optimal execution game with reinforcement learning
Not on the map. Why?
Abstract (arXiv)
The use of reinforcement learning algorithms in financial trading is becoming increasingly prevalent. However, the autonomous nature of these algorithms can lead to unexpected outcomes that deviate from traditional game-theoretical predictions and may even destabilize markets. In this study, we examine a scenario in which two autonomous agents, modelled with Double Deep Q-Learning, learn to liquidate the same asset optimally in the presence of market impact, under the Almgren-Chriss (2000) framework. We show that the strategies learned by the agents deviate significantly from the Nash equilibrium of the corresponding market impact game. Notably, the learned strategies exhibit supra-competitive solution, {which might be compatible with a tacit collusive behaviour}, closely aligning with the Pareto-optimal solution. We further explore how different levels of market volatility influence the agents' performance and the equilibria they discover, including scenarios where volatility differs between the training and testing phases.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 46 references that are in the map. First posted on arXiv 21 Aug 2024.
Builds on
8 of 46 references.
References · 8
- 2020pymoo: Multi-objective Optimization in Pythoncited by 196
- 2021Recent Advances in Reinforcement Learning in Financecited by 102
- 2018Double Deep Q-Learning for Optimal Executioncited by 39
- 2021Reinforcement Learning for Quantitative Tradingcited by 24
- 2019Multi-Agent Deep Reinforcement Learning for Liquidation Strategy Analysiscited by 15
- 2013A state-constrained differential game arising in optimal portfolio liquidationcited by 3
- 2018Trading algorithms with learning in latent alpha modelscited by 3
- 2020Interbank lending with benchmark rates: Pareto optima for a class of singular control gamescited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.