SearcharxivSearch

arXiv · 2308.02276

Optimal Liquidation with Conditions on Minimum Price

Abstract

The classical optimal trading problem is the closure of a position in an asset over a time interval; the trader maximizes an expected utility under the constraint that the position be fully closed by terminal time. Since the asset price is stochastic, the liquidation constraint may be too restrictive; the trader may want to relax it or slow down/stop trading depending on price behavior. We consider two additional parameters that serve these purposes within the Almgren-Chriss framework: a binary valued process $I$ that prescribes when trading takes place and a measurable set $S$ that prescribes when full liquidation is required. We give four examples for $S$ and $I$ which are defined in terms of a lower bound for the price process. The terminal cost of the control problem is $\infty$ over $S$ representing the liquidation constraint. The permanent price impact parameter enters the problem as the negative part of the terminal cost over $S^c$. $I$ modifies the running cost. A terminal cost that can take negative values implies 1) the backward stochastic differential equation (BSDE) associated with the value function of the control problem can explode to $-\infty$ backward in time and 2) existence results on minimal supersolutions of BSDE with singular terminal values and monotone drivers are not directly applicable. A key part of the solution is an assumption that balances market volume and the permanent price impact parameter and a lower bound on the BSDE based on this assumption. When liquidation costs are quadratic, the problem is convex and, under a general filtration, the minimal supersolution of the BSDE gives the value function and the optimal control. For the non-quadratic case, we assume a stochastic volatility model and focus on choices of $I$ and $S$ that are Markovian or can be broken into Markovian pieces. These give PDE/PDE-system representations for the value functions.

Explore related subjects

Keep this discovery

BibTeXRIS

Mervan Aksu, Alexandre Popier, Ali Devin Sezer. 2023-08-04. Optimal Liquidation with Conditions on Minimum Price. https://arxiv.org/abs/2308.02276

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR