Pith. sign in

REVIEW 3 major objections 4 minor 73 references

Model-free RL discovers profitable price-manipulation strategies from limited data more reliably than correctly specified models with noisy parameters, when volatility is intermediate.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

T0 review · grok-4.5

2026-07-11 01:18 UTC pith:GFGYOKRT

load-bearing objection Clean finite-sample head-to-head showing DDPG can find dynamic arbitrage under nonlinear impact more reliably than a correctly-specified but estimated model-based optimizer, with a real but limited confound on the reward. the 3 major comments →

arxiv 2607.06121 v1 pith:GFGYOKRT submitted 2026-07-07 q-fin.TR cs.AI

Can Reinforcement Learning Efficiently Discover Price Manipulation?

classification q-fin.TR cs.AI
keywords price manipulationdynamic arbitragereinforcement learningDDPGAlmgren-Chrissmarket impactoptimal executionparameter estimation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper asks whether a reinforcement-learning agent that knows nothing about the market-impact model can still find round-trip trading strategies that extract positive expected cash purely from non-linear permanent impact. In a discrete-time Almgren-Chriss market the authors first prove such strategies exist and compute the full-information optimum. They then give both the RL agent and a classical estimator the same finite sample of simulated executions. At intermediate volatility the RL policy reliably produces statistically significant profits and beats the model-based optimizer that is handicapped only by sampling error in its parameter estimates. High volatility washes out every method; low volatility lets accurate estimation regain the lead. The result matters because it shows that modern learning algorithms can uncover market vulnerabilities that regulators and market designers may not have anticipated, and that model-free methods can be more robust to estimation noise than correctly specified but imperfectly calibrated models.

Core claim

When permanent impact is concave, a Deep Deterministic Policy Gradient agent trained on a few hundred episodes of interaction discovers round-trip strategies with positive expected cash flow. At intermediate volatility those strategies outperform the classical route of estimating impact parameters from the same amount of data and then optimizing under the true functional form.

What carries the argument

The expected-cash objective under non-linear permanent impact f(v)= heta sign(v)|v|^δ plus linear temporary cost; this non-convex function admits dynamic arbitrage (round-trip strategies with E[X_T]>0) and is maximised either by SLSQP under full or estimated parameters or by DDPG that never sees the functional form.

Load-bearing premise

The true price process is exactly the discrete Almgren-Chriss model with the chosen power-law permanent impact; any real-market deviation from that functional form would change the relative performance of the two methods.

What would settle it

Re-run the finite-sample comparison on data generated by a different impact kernel (transient, stochastic, or empirically estimated from real meta-orders) and check whether DDPG still beats the correctly-specified-but-estimated SLSQP procedure at intermediate volatility.

Watch this falsifier — get emailed when new claim-graph text bears on it.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper asks whether a model-free DDPG agent can discover and exploit dynamic-arbitrage (price-manipulation) opportunities arising from nonlinear permanent impact more effectively than a correctly specified but finite-sample estimated model-based optimizer. Prices follow discrete-time Almgren–Chriss dynamics with permanent impact f(v)=θ sign(v)|v|^δ (δ=0.1) and linear temporary impact. Existence of round-trip strategies with positive expected cash is proved for the two-velocity case (Lemmas 3.1–3.2) and the unrestricted problem is solved numerically by multi-start SLSQP under full information. Two finite-sample procedures are then compared on the same number of trajectories: (i) impact-parameter estimation from simulated TWAP meta-orders followed by SLSQP (regSLSQP), and (ii) direct DDPG training. Out-of-sample tests (Table 4) show that, for intermediate volatility, DDPG trained on 500 episodes yields statistically significant positive cash and outperforms both regSLSQP500 and regSLSQP5000; at high volatility no method succeeds, while at low volatility the model-based estimator regains superiority.

Significance. If the intermediate-volatility ranking is robust, the result is of genuine interest to both market-microstructure and algorithmic-trading communities: it shows that a model-free learner can recover profitable round-trip strategies from limited interaction data and can be more robust to sampling error than a correctly specified parametric procedure. The clean existence proofs, multi-start SLSQP benchmark, transparent Almgren-style regressions, and 1000-path out-of-sample design with t-tests are methodological strengths that make the comparison falsifiable. The regulatory warning about unsupervised RL discovering manipulation is timely and well-motivated by the literature cited.

major comments (3)
  1. [§4.1, Eq. (11) and Table 4] Section 4.1, Eq. (11): the instantaneous reward is defined as r_t = S_t v_t − κ v_t² and therefore injects the true temporary-impact coefficient κ into the agent’s objective. The paper repeatedly describes the DDPG agent as “model-free”, “agnostic” and possessing “no direct knowledge ho of the values for the impacts” (abstract, §4, §5). Because the model-based baseline must recover κ (together with θ and δ) from noisy TWAP regressions (Eqs. 8–10), the head-to-head comparison in Table 4 (especially the intermediate-vol row) does not isolate the pure effect of avoiding parameter estimation under correct specification. Either the reward must be rewritten without κ or the claim of complete model-agnosticism must be qualified and the experiments re-run.
  2. [§5, Table 4] Section 5 and Table 4: DDPG is trained exclusively on M=500 episodes while regSLSQP is evaluated at both N=500 and N=5000. The strongest claim—that RL “consistently outperforms the model-based approach when parameter estimates are affected by sampling error”—therefore rests on an unequal data budget. No experiment is reported in which DDPG is given a 5000-episode training set. Without that control it remains possible that the ranking simply reflects the relative sample efficiency of the two methods rather than an intrinsic advantage of model-free learning under correct specification.
  3. [Abstract and §5] The data-generating processes used by the two finite-sample methods are not identical. regSLSQP estimates parameters from fixed TWAP meta-orders (Section 3.3.2), whereas DDPG generates its own exploratory trajectories. The abstract and §5 assert that both methods are “trained ho on the same amount of data.” While the number of trajectories is matched, the information content is not; this asymmetry should be acknowledged and, if possible, controlled (e.g., by also estimating impact parameters from the same DDPG trajectories).
minor comments (4)
  1. [Introduction and §3.1] Several typographical errors appear in the main text: “preventsan accurate” (p. 4), “potentiallyunintendedmarket” (p. 4), “around-tripstrategy” (p. 4), “deltaincreases” (caption of Fig. 1). A careful proof-reading pass is needed.
  2. [Table 2] Table 2 formatting is hard to parse (mixed scientific notation, missing separators). Consider a cleaner layout that separates point estimates from standard errors.
  3. [Figs. 2 and 10] Figure 2 and Figure 10 captions refer to “the green (red) area” for positive/negative cash, but the colour coding is not explained in the main text; a short legend would help.
  4. [§4.2 and Table 3] The soft-update parameter, learning-rate schedule and exploration-noise decay are given only in footnotes or the algorithm box; collecting them in Table 3 would improve reproducibility.

Circularity Check

0 steps flagged

Empirical OOS simulation comparison under known DGP; reward, estimators and cash are independently defined with no reduction of reported outperformance to a fitted constant by construction.

full rationale

The paper's load-bearing claims are (i) existence of positive-E[X_T] round-trips under the stated discrete-time AC dynamics with concave permanent impact (Prop. 2.1, Lemmas 3.1-3.2, SLSQP benchmark) and (ii) finite-sample head-to-head of DDPG vs. regression+SLSQP on held-out paths (Table 4). Existence follows by direct expansion of the cash functional (Eq. 4) and elementary calculus under the model definition; it is not circular. Parameter estimation (Eqs. 8-10) is ordinary least-squares on independent TWAP meta-orders; the subsequent SLSQP step and OOS cash evaluation use the true DGP, so sampling error is measured rather than assumed away. DDPG trains on the same environment with an instantaneous reward that matches the temporary-impact term of the cash expansion; the permanent-impact channel is observed only through the price process. The final numbers in Table 4 are Monte-Carlo averages of true cash under the learned policies; they are not algebraically forced by any fitted constant or self-referential definition. Self-citations (Macrì-Lillo 2025, Macrì et al. 2025) supply only prior RL-execution context and are not used to justify uniqueness, existence, or the performance ranking. Minor design asymmetries (κ known inside the reward, unequal episode budgets) affect fairness of the comparison but do not create circularity of derivation. Score 1 reflects only the presence of non-load-bearing self-citations; the central empirical claim remains independent.

Axiom & Free-Parameter Ledger

6 free parameters · 4 axioms · 0 invented entities

The paper works entirely inside a simulated Almgren-Chriss environment whose functional form and numerical coefficients are chosen by the authors; the central comparison therefore rests on those modelling choices plus standard optimisation and RL machinery. No new physical entities are postulated.

free parameters (6)
  • permanent-impact exponent δ = 0.1
    Fixed at 0.1 (Table 1) to guarantee strong nonlinearity and therefore profitable manipulation; not estimated from data.
  • permanent-impact coefficient θ = 0.0001
    Set to 0.0001 so that σ/θ matches ratios reported by Almgren et al. (2005); chosen by hand.
  • temporary-impact coefficient κ = 0.0003
    Set to 0.0003 for the same ratio-matching reason; chosen by hand.
  • volatility levels σ = 0.0168 / 0.003 / 0.002
    Three discrete values (0.0168, 0.003, 0.002) selected to span high/intermediate/low regimes; the intermediate value is the regime in which the headline claim holds.
  • horizon T and action bound b = T=21, b=15
    T = 21, |v| ≤ 15 fixed for all experiments; determine the feasible strategy space.
  • DDPG training budget and architecture = M=500, B=128, lr=0.1
    M = 500 episodes, batch 128, 3×64 SiLU layers, learning rate 0.1 with decay, etc. (Table 3); chosen without systematic ablation.
axioms (4)
  • domain assumption Price follows discrete-time Almgren-Chriss dynamics with permanent impact f(v)=θ sign(v)|v|^δ and linear temporary impact (Eqs. 1–3).
    Defines the entire simulated market; every existence proof and numerical comparison is conditional on this DGP.
  • domain assumption A risk-neutral agent maximises expected terminal cash subject to exact round-trip inventory constraint q0 = qT = 0.
    Standard dynamic-arbitrage definition (Huberman-Stanzl); used throughout Sections 2–5.
  • standard math For δ < 1 the expected-cash objective is continuous and coercive, hence a maximiser exists (Prop. 2.1).
    Proved in Appendix A; guarantees the optimisation problems are well-posed.
  • domain assumption Impact parameters can be recovered from TWAP meta-order regressions of the form given by Almgren et al. (2005) (Eqs. 8–10).
    Underpins the model-based baseline; any misspecification of the regression would alter the comparison.

pith-pipeline@v1.1.0-grok45 · 23051 in / 3261 out tokens · 40324 ms · 2026-07-11T01:18:25.581342+00:00 · methodology

0 comments
read the original abstract

In this paper, we investigate whether a model-free RL agent can identify and exploit price manipulation opportunities more effectively than a traditional model-based approach that assumes correct specification of the data-generating process but relies on noisy parameter estimates. We consider a single-asset market in which prices evolve according to an Almgren-Chriss framework with non-linear permanent impact and linear temporary impact. We first establish the existence of price-manipulative strategies in discrete time and compute the optimal benchmark strategy using Sequential Least Squares Quadratic Programming under full information. We then compare two finite-sample learning approaches: a model-based procedure that estimates impact parameters from simulated execution data and an agnostic RL approach based on Deep Deterministic Policy Gradient, trained directly on the same amount of data. For intermediate volatility, the RL agent successfully discovers profitable manipulative strategies without explicit knowledge of the underlying model, even when training data are quite limited. More importantly, RL consistently outperforms the model-based approach when parameter estimates are affected by sampling error, despite the latter benefiting from the correct model specification. For large volatility, all methods are unable to identify manipulation opportunities, while for small volatility, the model based approach outperforms RL. These findings highlight both the effectiveness of RL in complex control problems and the risks associated with deploying learning algorithms in financial markets without appropriate safeguards.

Figures

Figures reproduced from arXiv: 2607.06121 by Andrea Macr\`i, Fabrizio Lillo, Ioanna-Yvonni Tsaknaki.

Figure 1
Figure 1. Figure 1: The optimal long position, nα∗ , as a function of δ for the PnD strategy. Notice that we do not have a closed-form analytical solution for the optimal value of n, but only for the optimal value of α, which it￾self depends on n. Therefore, when |A| = 2, we first determine the optimal trading veloc￾ity α ∗ for each fixed n, and then choose the value of n that maximizes the expected cash flow. Finally, for a … view at source ↗
Figure 2
Figure 2. Figure 2: Top-Left: The optimal trading strategy by SLSQP and the corresponding inventory (red line). Bottom-Left: The expected cash-flow. The green (red) area indicates the region for which E[Xt ] > 0 (E[Xt ] < 0). Right: The histogram of E[XT ] from the different starting points. Note: The parameters used are the ones reported on [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Expected cash vs the true parameters; δ, θ and κ when the optimal strategy is found using ˆδ, ˆθ and ˆκ. 3.3.2 Estimation of impact parameters Here we present a parameter estimation method based on Almgren et al. (2005). In Almgren et al. (2005), the authors used real metaorders3 , thus here we estimate the 3Metaorders are large trading orders that are split into pieces and executed incrementally. 9 [PITH… view at source ↗
Figure 4
Figure 4. Figure 4: Top: Heatmap of the executed actions chosen by DDPG during the training phase of 500 episodes. Bottom: The actions chosen from DDPG along with the corresponding inventory during the final training episode. 15 [PITH_FULL_IMAGE:figures/full_fig_p015_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The 25-episode moving averages Left: of the action aggressiveness and Right: of signed action directionality during training. Training results. We train the agent using the procedure described above and termi￾nate training after episode 500, since no noticeable improvement in the learned policy is observed beyond this point. The top panel of Fig. (4) shows a heatmap of the actions se￾lected at each time st… view at source ↗
Figure 6
Figure 6. Figure 6: The heatmap of the sign-invariant distance on the left for all the strategies and on the right with precision of two colors for all the strategies in Fig. (2) [PITH_FULL_IMAGE:figures/full_fig_p027_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Each point represents a pair of strategies whose sign-invariant distance is less than or equal to the threshold η. (a) (b) [PITH_FULL_IMAGE:figures/full_fig_p027_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: The two strategies with the largest discrepancy in expected cash for which d(i, j) = 0.0855. D Estimating the Parameters in SLSQP In this Appendix we justify the derivation for the estimation of the permanent impact parameter θ as a function of the exponent impact parameter δ. Since ˆδ = argminδ∈(0,1)X N i=1  Ii − ˆθ(δ) T S0 qi T δ2 | {z } RSS(θˆ) (26) 27 [PITH_FULL_IMAGE:figures/full_fig_p027_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Estimation of the impact parameters along with their standard errors as a function of the number of metaorders N (a) when σ = 0.0168, (b) when σ = 0.003 and (c) when σ = 0.002. 29 [PITH_FULL_IMAGE:figures/full_fig_p029_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Plots (a-c) when N = 500 and (d-f) when N = 5000 metaorders. In each panel, Top-Left: The optimal trading strategy by regSLSQPN and the corresponding inventory (red line). Bottom-Left: The expected cash-flow. The green (red) area indicates the region for which E[Xt ] > 0 (E[Xt ] < 0). Right: The histogram of E[XT ] from the different starting points [PITH_FULL_IMAGE:figures/full_fig_p030_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: The 25-episode moving averages Left: of the action aggressiveness and Right: of signed action directionality during training and the reward is defined as in Eq. (27). 30 [PITH_FULL_IMAGE:figures/full_fig_p030_11.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

73 extracted references · 73 canonical work pages · 3 internal anchors

  1. [1]

    Quantitative Finance , year =

    Gianbiagio Curato and Jim Gatheral and Fabrizio Lillo , title =. Quantitative Finance , year =

  2. [2]

    Applied Mathematical Finance , volume =

    Brian Ning and Franco Ho Ting Lin and Sebastian Jaimungal , title =. Applied Mathematical Finance , volume =

  3. [3]

    Applied Mathematical Finance , volume =

    Andrea Macrì and Fabrizio Lillo , title =. Applied Mathematical Finance , volume =

  4. [4]

    Quantitative Finance , volume =

    Aurélien Alfonsi and Antje Fruth and Alexander Schied , title =. Quantitative Finance , volume =

  5. [5]

    Almgren and N

    R. Almgren and N. Chriss , title =. Journal of Risk , year =

  6. [6]

    Huberman and W

    G. Huberman and W. Stanzl , title =. Econometrica , volume =

  7. [7]

    Olivier Gueant , title =

  8. [8]

    Proceedings of the 31st International Conference on Machine Learning , pages =

    Deterministic Policy Gradient Algorithms , author =. Proceedings of the 31st International Conference on Machine Learning , pages =. 2014 , editor =

  9. [9]

    Proceedings of the 4th International Conference on Learning Representations , year =

    Continuous Control with Deep Reinforcement Learning , author =. Proceedings of the 4th International Conference on Learning Representations , year =

  10. [10]

    Multi-asset Optimal Execution and Statistical Arbitrage Strategies under Ornstein--Uhlenbeck Dynamics , journal =

    Bergault, Philippe and Drissi, Fay. Multi-asset Optimal Execution and Statistical Arbitrage Strategies under Ornstein--Uhlenbeck Dynamics , journal =

  11. [11]

    Journal of Financial Markets , volume =

    Dimitris Bertsimas and Andrew Lo , title =. Journal of Financial Markets , volume =

  12. [12]

    Gatheral , title =

    J. Gatheral , title =. Quantitative Finance , volume =

  13. [13]

    Available at SSRN: https://ssrn.com/abstract=4639959 , year =

    Alvaro Cartea and Patrick Chang and Gabriel Garcıa-Arenas , title =. Available at SSRN: https://ssrn.com/abstract=4639959 , year =

  14. [14]

    Risk , volume =

    Almgren, Robert and Thum, Chee and Hauptmann, Emmanuel and Li, Hong , title =. Risk , volume =

  15. [15]

    Andersen and T

    T.G. Andersen and T. Bollerslev and F.X. Diebold and P. Labys , title =. Econometrica , year =

  16. [16]

    Zhelezniak, Vitalii and Savkov, Aleksandar and Shen, April and Hammerla, Nils , title =. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) , year =

  17. [17]

    Pang-Ning Tan and Michael Steinbach and Vipin Kumar , title =

  18. [18]

    Finance and Stochastics , year =

    Alexander Schied and Torsten Schöneborn , title =. Finance and Stochastics , year =

  19. [19]

    Quantitative Finance , year =

    Bouchaud, Jean-Philippe and Gefen, Yuval and Potters, Marc and Wyart, Matthieu , title =. Quantitative Finance , year =

  20. [20]

    Doyne and Gerig, Austin and Lillo, Fabrizio and Mike, Szabolcs , title =

    Farmer, J. Doyne and Gerig, Austin and Lillo, Fabrizio and Mike, Szabolcs , title =. Quantitative Finance , year =

  21. [21]

    Journal of Financial Markets , year =

    Obizhaeva, Anna and Wang, Jiang , title =. Journal of Financial Markets , year =

  22. [22]

    Mathematical Finance , year =

    Gatheral, Jim and Schied, Alexander and Slynko, Alla , title =. Mathematical Finance , year =

  23. [23]

    Proceedings of the 23rd International Conference on Machine Learning (ICML) , year =

    Nevmyvaka, Yuriy and Feng, Yi and Kearns, Michael , title =. Proceedings of the 23rd International Conference on Machine Learning (ICML) , year =

  24. [24]

    2014 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr) , pages =

    Hendricks, Dieter and Wilcox, Diane , title =. 2014 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr) , pages =. 2014 , publisher =

  25. [25]

    IEEE Transactions on Neural Networks , year =

    Moody, John and Saffell, Matthew , title =. IEEE Transactions on Neural Networks , year =

  26. [28]

    Quantitative finance , volume=

    Fluctuations and response in financial markets: the subtle nature of `random' price changes , author=. Quantitative finance , volume=

  27. [29]

    Finance and Stochastics , volume=

    Reinforcement learning and stochastic optimisation , author=. Finance and Stochastics , volume=. 2022 , publisher=

  28. [31]

    Kraft, Dieter , title =

  29. [32]

    Measuring price impact and information content of trades in a time-varying setting

    Measuring price impact and information content of trades in a time-varying setting , author=. arXiv preprint arXiv:2212.12687 , year=

  30. [33]

    Doyne Farmer and Fabrizio Lillo , title =

    Elia Zarinelli and Michele Treccani and J. Doyne Farmer and Fabrizio Lillo , title =. Market Microstructure and Liquidity , volume =

  31. [34]

    Quantitative Finance , volume =

    Natalia Bershova and Dmitry Rakhlin , title =. Quantitative Finance , volume =

  32. [35]

    Moyano and Austin Gerig and J

    Esteban Moro and Javier Vicente and Luis G. Moyano and Austin Gerig and J. Doyne Farmer and Salvatore Vaglica and Fabrizio Lillo and Rosario N. Mantegna , title =. Physical Review E , volume =

  33. [36]

    Physical Review Letters , volume =

    Fabio Bucci and Michael Benzaquen and Fabrizio Lillo and Jean-Philippe Bouchaud , title =. Physical Review Letters , volume =

  34. [37]

    Siegfried Stiehl , title =

    Alessio Azzutti and Wolf-Georg Ringe and H. Siegfried Stiehl , title =. University of Pennsylvania Journal of International Law , year =

  35. [38]

    IEEE Symposium Series on Computational Intelligence , pages=

    Can an AI Perform Market Manipulation at Its Own Discretion? -- A Genetic Algorithm Learns in an Artificial Market Simulation , author=. IEEE Symposium Series on Computational Intelligence , pages=

  36. [39]

    IEEE Conference on Evolving and Adaptive Intelligent Systems , pages=

    Learning Unfair Trading: A Market Manipulation Analysis from the Reinforcement Learning Perspective , author=. IEEE Conference on Evolving and Adaptive Intelligent Systems , pages=

  37. [40]

    Minds and Machines , volume=

    Ethical Issues for Autonomous Trading Agents , author=. Minds and Machines , volume=

  38. [41]

    Journal of Financial Markets , volume=

    Microstructure-Based Manipulation: Strategic Behavior and Performance of Spoofing Traders , author=. Journal of Financial Markets , volume=

  39. [42]

    Farmer and Rosario N

    Fabrizio Lillo and J.D. Farmer and Rosario N. Mantegna , title =. Nature , volume =

  40. [43]

    Doyne and Mantegna, Rosario N

    Lillo, Fabrizio and Farmer, J. Doyne and Mantegna, Rosario N. Price Impact Function of a Single Transaction. The Complex Dynamics of Economic Interaction. 2004

  41. [44]

    Quantitative Finance , volume =

    Wei-Xing Zhou , title =. Quantitative Finance , volume =. 2012 , publisher =

  42. [45]

    Potters and J.P

    M. Potters and J.P. Bouchaud , title =. Physica A: Statistical Mechanics and its Applications , volume =

  43. [46]

    Quantifying stock-price response to demand fluctuations , author =. Phys. Rev. E , volume =. 2002 , publisher =

  44. [47]

    Almgren and N

    R. Almgren and N. Chriss. Optimal execution of portfolio transactions. Journal of Risk, 3: 0 5--39, 2000

  45. [48]

    Direct estimation of equity market impact

    Robert Almgren, Chee Thum, Emmanuel Hauptmann, and Hong Li. Direct estimation of equity market impact. Risk, 18: 0 58--62, 2005

  46. [49]

    Andersen, T

    T.G. Andersen, T. Bollerslev, F.X. Diebold, and P. Labys. Modelling and forecasting realized volatility. Econometrica, 71: 0 579--625, 2003

  47. [50]

    Siegfried Stiehl

    Alessio Azzutti, Wolf-Georg Ringe, and H. Siegfried Stiehl. Machine learning, market manipulation, and collusion on capital markets: Why the ``black box" matters. University of Pennsylvania Journal of International Law, 43: 0 79--136, 2021

  48. [51]

    Spoofing and manipulating order books with learning algorithms

    Alvaro Cartea, Patrick Chang, and Gabriel Garcıa-Arenas. Spoofing and manipulating order books with learning algorithms. Available at SSRN: https://ssrn.com/abstract=4639959, 2023

  49. [52]

    Optimal execution with non-linear transient market impact

    Gianbiagio Curato, Jim Gatheral, and Fabrizio Lillo. Optimal execution with non-linear transient market impact. Quantitative Finance, 17: 0 41--54, 2017

  50. [53]

    Gatheral

    J. Gatheral. No-dynamic-arbitrage and market impact. Quantitative Finance, 10: 0 749--759, 2010

  51. [54]

    The Financial Mathematics of Market Liquidity

    Olivier Gueant. The Financial Mathematics of Market Liquidity. Chapman & Hall/CRC Financial Mathematics Series, 2016

  52. [55]

    A reinforcement learning extension to the almgren-chriss framework for optimal trade execution

    Dieter Hendricks and Diane Wilcox. A reinforcement learning extension to the almgren-chriss framework for optimal trade execution. In 2014 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr), pages 457--464. IEEE, 2014

  53. [56]

    Huberman and W

    G. Huberman and W. Stanzl. Price manipulation and quasi-arbitrage. Econometrica, 72: 0 1247–1275, 2004

  54. [57]

    A Deep Reinforcement Learning Framework for the Financial Portfolio Management Problem

    Zhengyao Jiang, Dixing Xu, and Jinjun Liang. A deep reinforcement learning framework for the financial portfolio management problem. arXiv preprint arXiv:1706.10059, 2017

  55. [58]

    u r Dynamik der Flugsysteme, Deutsche Forschungs- und Versuchsanstalt f \

    Dieter Kraft. A software package for sequential quadratic programming. Technical Report DFVLR-FB 88-28, Institut f \"u r Dynamik der Flugsysteme, Deutsche Forschungs- und Versuchsanstalt f \"u r Luft- und Raumfahrt, 1988

  56. [59]

    Microstructure-based manipulation: Strategic behavior and performance of spoofing traders

    Eun Jung Lee, Kyoung-Soo Eom, and Kyung Suh Park. Microstructure-based manipulation: Strategic behavior and performance of spoofing traders. Journal of Financial Markets, 16: 0 227--252, 2013

  57. [60]

    T. P. Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. In Proceedings of the 4th International Conference on Learning Representations, Proceedings of Machine Learning Research. PMLR, 2016

  58. [61]

    Farmer, and Rosario N

    Fabrizio Lillo, J.D. Farmer, and Rosario N. Mantegna. Master curve for price-impact function. Nature, 421: 0 129–130, 2003

  59. [62]

    Doyne Farmer, and Rosario N

    Fabrizio Lillo, J. Doyne Farmer, and Rosario N. Mantegna. Price impact function of a single transaction. In The Complex Dynamics of Economic Interaction, pages 153--160, Berlin, Heidelberg, 2004. Springer Berlin Heidelberg

  60. [63]

    Reinforcement learning for optimal execution when liquidity is time-varying

    Andrea Macrì and Fabrizio Lillo. Reinforcement learning for optimal execution when liquidity is time-varying. Applied Mathematical Finance, 31: 0 312–342, 2025

  61. [64]

    Deep reinforcement learning for optimal trading with partial information

    Andrea Macrì, Sebastian Jaimungal, and Fabrizio Lillo. Deep reinforcement learning for optimal trading with partial information. arXiv:2511.00190, 2025

  62. [65]

    Learning unfair trading: A market manipulation analysis from the reinforcement learning perspective

    Enrique Mart \' nez-Miranda, Frank McGroarty, and Edward Tsang. Learning unfair trading: A market manipulation analysis from the reinforcement learning perspective. In IEEE Conference on Evolving and Adaptive Intelligent Systems, pages 103--108, 2016

  63. [66]

    Deep Reinforcement Learning for Online Optimal Execution Strategies

    Alessandro Micheli and M \'e lodie Monod. Deep reinforcement learning for online optimal execution strategies. arXiv preprint arXiv:2410.13493, 2024

  64. [67]

    Can an ai perform market manipulation at its own discretion? -- a genetic algorithm learns in an artificial market simulation

    Takanobu Mizuta. Can an ai perform market manipulation at its own discretion? -- a genetic algorithm learns in an artificial market simulation. In IEEE Symposium Series on Computational Intelligence, pages 407--414, 2020

  65. [68]

    Learning to trade via direct reinforcement

    John Moody and Matthew Saffell. Learning to trade via direct reinforcement. IEEE Transactions on Neural Networks, 12: 0 875--889, 2001

  66. [69]

    Reinforcement learning for optimized trade execution

    Yuriy Nevmyvaka, Yi Feng, and Michael Kearns. Reinforcement learning for optimized trade execution. In Proceedings of the 23rd International Conference on Machine Learning (ICML), pages 673--680, 2006

  67. [70]

    Double deep q-learning for optimal execution

    Brian Ning, Franco Ho Ting Lin, and Sebastian Jaimungal. Double deep q-learning for optimal execution. Applied Mathematical Finance, 28: 0 361--380, 2021

  68. [71]

    Potters and J.P

    M. Potters and J.P. Bouchaud. More statistical properties of order books and price impact. Physica A: Statistical Mechanics and its Applications, 324: 0 133--140, 2003

  69. [72]

    Deterministic policy gradient algorithms

    David Silver, Guy Lever, Nicolas Heess, Thomas Degris, Daan Wierstra, and Martin Riedmiller. Deterministic policy gradient algorithms. In Eric P. Xing and Tony Jebara, editors, Proceedings of the 31st International Conference on Machine Learning, volume 32 of Proceedings of Machine Learning Research, pages 387--395, Bejing, China, 22-24 Jun 2014. PMLR

  70. [73]

    Introduction to Data Mining

    Pang-Ning Tan, Michael Steinbach, and Vipin Kumar. Introduction to Data Mining. Pearson Education Limited, 2013

  71. [74]

    Wellman and Uday Rajan

    Michael P. Wellman and Uday Rajan. Ethical issues for autonomous trading agents. Minds and Machines, 27: 0 609--624, 2017

  72. [75]

    Correlation coefficients and semantic textual similarity

    Vitalii Zhelezniak, Aleksandar Savkov, April Shen, and Nils Hammerla. Correlation coefficients and semantic textual similarity. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 951--962. Association for Computational Li...

  73. [76]

    Universal price impact functions of individual trades in an order-driven market

    Wei-Xing Zhou. Universal price impact functions of individual trades in an order-driven market. Quantitative Finance, 12 0 (8): 0 1253--1263, 2012