Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.35063

Optimal Liquidation with Support and Resistance Levels under Multi-Skew Brownian Motion

Jun Maeda
View original source ↗Read source document ↗Export metadata ↓

Abstract

We solve the perpetual liquidation problem for a geometric multi-skew Brownian motion carrying local-time pushes upward at a support level and downward at a resistance level, a model of technical analysis that is Markov in the price alone. Three geometries arise, separated by a closed-form criterion: the continuation band lies below resistance, straddles it, or pins its upper edge there. Selling into resistance is a conclusion rather than an assumption. Identification is asymmetric: exercise behaviour determines the support parameters exactly, while the strength of resistance is recoverable only on an interval with a closed-form endpoint.

Explore related subjects

q-fin.MFmath.PRq-fin.TR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jun Maeda. 2026-09-28. Optimal Liquidation with Support and Resistance Levels under Multi-Skew Brownian Motion. https://arxiv.org/abs/2609.35063

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Finite-Horizon Reversible Investment under Multi-Factor Dynamics

We study a finite-horizon reversible investment problem in which a risk-neutral firm adjusts capacity at a proportional purchase cost and a lower salvage value under multi-factor geometric Brownian motion. Via the singular control--optimal switching correspondence, the marginal value of capacity solves a family of parabolic double-obstacle problems. We prove existence, uniqueness and local Sobolev regularity of the strong solution, characterize investment, waiting and disinvestment regions by continuous, strictly separated free boundaries, and verify optimality of the reflected capacity process. Numerically, joint demand improvements shift both boundaries super-additively, 1.5--2.7 times as strongly at the disinvestment boundary, depending on factor correlation.

q-fin.MF↗
arXiv2026

Delegation or competition: optimal liquidation across dark and lit pools with information privilege

We study the optimal liquidation problem in both dark and lit pools for an investor delegating the execution of a large position to a broker, in a continuous-time setting with market impact and execution uncertainty. First, we design an optimal compensation scheme between the investor and a broker who owns dark pools, may internalize the client's order flow, and enjoys an information privilege over the rest of the market. We explicitly characterize the broker's optimal internalization, hedging, and routing strategies across the lit venue and the dark pools using BSDE theory. Second, we study a purely competitive model in which the investor liquidates directly on the open market against a crowd of strategic high-frequency traders, leading to a major-minor mean-field game for which we provide explicit solutions to the associated HJB Fokker-Planck system. Finally, we illustrate our results through numerical experiments, comparing the welfare and the price impact of the delegation regime with those of direct execution, and quantifying the economic value of broker intermediation.

q-fin.MF↗
arXiv2026

Maximum principle for robust utility optimization via Tsallis relative entropy

This paper investigates an optimal consumption-investment problem featuring recursive utility via Tsallis relative entropy. We establish a fundamental connection between this optimization problem and a quadratic backward stochastic differential equation (BSDE), demonstrating that the value function is the value process of the solution to this BSDE. Utilizing advanced BSDE techniques, we derive a novel stochastic maximum principle that provides necessary conditions for both the optimal consumption process and terminal wealth. Furthermore, we prove the existence of optimal strategy and analyze the coupled forward-backward system arising from the optimization problem.

q-fin.MF↗