Paper: arXiv 2503.04072
Authors: Zhou Fang, Arie Israel
Abstract
In this paper, we introduce a robust market making framework based on Wasserstein distance, utilizing a stochastic policy approach enhanced by entropy regularization. We demonstrate that, under mild assumptions, the robust market making problem can be reformulated as a convex optimization question. Additionally, we outline a methodology for selecting the optimal radius of the Wasserstein ball, further refining our framework’s effectiveness.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 3.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper presents a complex theoretical framework involving Wasserstein distance, convex optimization, and entropy regularization, with heavy reliance on mathematical derivations and assumptions. However, it lacks empirical validation through backtests, code implementations, or statistical metrics, remaining primarily in the theoretical domain.
Research Flowchart
flowchart TD A["Research Goal: Robust Market Making"] --> B["Model Formulation<br>Wasserstein Distance &<br>Entropy-Regularized Stochastic Policy"] B --> C["Reformulation Step<br>Proof: Convex Optimization Problem"] C --> D["Data: Equity Market Simulations<br>& Historical Microstructure"] D --> E["Computational Process<br>Optimal Spread Calculation<br>& Wasserstein Ball Radius Selection"] E --> F["Key Outcome 1: Robust Pricing Strategy<br>Validated on Simulated/Real Data"] E --> G["Key Outcome 2: Scalable Algorithm<br>via Entropy Regularization"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a robust market making framework based on Wasserstein distance that uses a stochastic policy approach enhanced by entropy regularization and shows that the robust problem can be reformulated as a convex optimization.
Source sentence
In this paper, we introduce a robust market making framework based on Wasserstein distance, utilizing a stochastic policy approach enhanced by entropy regularization. We demonstrate that, under mild assumptions, the robust market making problem can be reformulated as a convex optimization question.
Assumes 6
- The ask spread ϵ+ and bid spread ϵ− are strictly positive. market
Source sentence
Here, we assume ϵ+ > 0 and ϵ−> 0.
- The random variables ΔN⁺(ϵ⁺) and ΔN⁻(ϵ⁻) follow the probability distributions Q⁺(ϵ⁺) and Q⁻(ϵ⁻), respectively. model
Source sentence
We assume the random variables ∆N +(ϵ+) and ∆N −(ϵ−) are distributed according to probability dis-tributions Q+(ϵ+) and Q−(ϵ−) on R, respectively.
- The asset price change ΔS is independent of the order‑arrival measures Q⁺(ϵ⁺) and Q⁻(ϵ⁻). statistical
Source sentence
Here, ∆S follows a probability measure that is independent of the measures of Q+(ϵ+) and Q−(ϵ−).
- The expected change in the asset price is zero, so expected cash change equals expected wealth change. statistical
Source sentence
If we assume that the expected change in the asset price is zero, then it follows that the expected change in cash is equivalent to the expected change in total wealth.
Show 2 more
- In the classical setting the market‑making policy is deterministic, mapping the state (S,Q) to fixed spreads ϵ⁺(S,Q) and ϵ⁻(S,Q). model
Source sentence
In the above classical setting, the policy is deterministic, meaning that given the current state (S, Q), the policy prescribes a deterministic bid and ask spread ϵ+(S, Q) and ϵ−(S, Q), respectively.
- Deterministic policies limit the choice of policies and create difficulties when converting the problem to a robust optimization setting. model
Source sentence
However, assuming a deterministic policy not only limits our choice of possible policies but also poses difficulties when modifying the market-making problem into a robust optimization setting.
Data
- standardized buy and sell order data order-book unknown
Source sentence
The empirical data for standardized buy and sell orders are given by {∆e N + i }n i=1 and {∆e N − i }n i=1, respectively.
Costs
Not applicable
Finds 2
- The robust market‑making optimization problem can be reformulated as a convex optimization problem under mild assumptions. theoretical
Source sentence
We demonstrate that, under mild assumptions, the robust market making problem can be reformulated as a convex optimization question.
- The optimal stochastic policy is given in closed form by π* (ϵ⁺,ϵ⁻) ∝ exp( … ) as stated in Theorem 1. theoretical
Source sentence
The optimal policy for the problem stated in (12) is given by: π∗(ϵ+ 0 , ϵ− 0 ) = M ∗(ϵ+ 0 , ϵ− 0 ) R (R+)2 M ∗(ϵ+, ϵ−) dϵ+ dϵ−, M ∗(ϵ+, ϵ−) = exp ( 1 γ " (A −2ηCh+(ϵ+))α∗,+ −(B −2ηCh−(ϵ−))α∗,− −η h+(ϵ+)2β∗,+ −2h+(ϵ+)h−(ϵ−)α∗,+α∗,−+ h−(ϵ−)2β∗,−#) L(ϵ+, ϵ−), L(ϵ+, ϵ−) = exp ( 1 γ h (S + ϵ+)f +(ϵ+) −(S −ϵ−)f −(ϵ−) −ηC2i) .
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 7 related papers). Coverage is partial, so this is neither replication nor refutation.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.