Deep Reinforcement Learning in Non-Markov Market-Making

We develop a deep reinforcement learning (RL) framework for an optimal market-making (MM) trading problem, specifically focusing on price processes with semi-Markov and Hawkes Jump-Diffusion dynamics. We begin by discussing the basics of RL and the deep RL framework used; we deployed the state-of-the-art Soft Actor–Critic (SAC) algorithm for the deep learning part. The SAC algorithm is an off-policy entropy maximization algorithm more suitable for tackling complex, high-dimensional problems with continuous state and action spaces, like those in optimal market-making (MM). We introduce the optimal MM problem considered, where we detail all the deterministic and stochastic processes that go into setting up an environment to simulate this strategy. Here, we also provide an in-depth overview of the jump-diffusion pricing dynamics used and our method for dealing with adverse selection within the limit order book, and we highlight the working parts of our optimization problem. Next, we discuss the training and testing results, where we provide visuals of how important deterministic and stochastic processes such as the bid/ask prices, trade executions, inventory, and the reward function evolved. Our study includes an analysis of simulated and real data. We include a discussion on the limitations of these results, which are important points for most diffusion style models in this setting.

Authors

Institutions

Publication Details

Journal
Risks
Published
2025-02-24
DOI
https://doi.org/10.3390/risks13030040
Citations
1
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deep Reinforcement Learning in Non-Markov Market-Making

Anatoliy Swishchuk, Luca Lalor
1 citations
Risks
Reinforcement Learning in Robotics
2.48
article

Deep Reinforcement Learning in Non-Markov Market-Making

Anatoliy Swishchuk, Luca Lalor
article en
1 citations

Abstract

We develop a deep reinforcement learning (RL) framework for an optimal market-making (MM) trading problem, specifically focusing on price processes with semi-Markov and Hawkes Jump-Diffusion dynamics. We begin by discussing the basics of RL and the deep RL framework used; we deployed the state-of-the-art Soft Actor–Critic (SAC) algorithm for the deep learning part. The SAC algorithm is an off-policy entropy maximization algorithm more suitable for tackling complex, high-dimensional problems with continuous state and action spaces, like those in optimal market-making (MM). We introduce the optimal MM problem considered, where we detail all the deterministic and stochastic processes that go into setting up an environment to simulate this strategy. Here, we also provide an in-depth overview of the jump-diffusion pricing dynamics used and our method for dealing with adverse selection within the limit order book, and we highlight the working parts of our optimization problem. Next, we discuss the training and testing results, where we provide visuals of how important deterministic and stochastic processes such as the bid/ask prices, trade executions, inventory, and the reward function evolved. Our study includes an analysis of simulated and real data. We include a discussion on the limitations of these results, which are important points for most diffusion style models in this setting.

RisksVol. 13(3)
University of Calgary (CA)
Mitacs, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 12%
Reinforcement Learning in Robotics
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.