Randomness in Algorithm Trading

Randomness in Algorithm Trading

Modern algorithmic trading strategies often rely on deterministic execution, which can be exploited by sophisticated adversaries who learn and anticipate order flows. This project tackles the challenge of making trading execution robust against such adversarial learning.

We introduce a novel framework for stochastic execution policies: instead of following predictable patterns, our approach injects carefully designed randomness into order execution. Among the randomization mechanisms explored, the Ornstein–Uhlenbeck (OU) mean-reverting noise stands out, significantly reducing adversarial predictability and improving trading performance.

Our results show that the OU-based policy not only makes execution harder to predict for adversaries, but also delivers tangible improvements in portfolio Sharpe ratio, all while maintaining strict risk controls. These findings highlight the power of dynamic, game-theoretic adaptation in algorithmic trading.

Curious how randomness can become a strategic edge in financial markets? Dive into the full paper for the complete methodology, experiments, and insights.


Rayi Makori*

Rayi Makori*

BSc in Economics and Computer Science

Vincenzo Della Ratta

Vincenzo Della Ratta

BSc in Economics and Finance

Preslav Georgiev

Preslav Georgiev

BSc in Economics and Computer Science

Matteo Roda

Matteo Roda

MSc in Data Science

Hunor Csenteri

Hunor Csenteri

BSc in Economics and Finance

Neel Roy

Neel Roy

BSc in Mathematical and Computing Sciences for AI

David Livshits

David Livshits

BSc in Economics and Computer Science