arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.0768q-fin.CPq-fin.TR
收藏

一个最优订单执行问题的数值解法

Numerical methods for an optimal order execution problem

Fabien Guilbaud, Mohamed Mnif, Huyên Pham

摘要:

本文研究了具有买卖价差和市场价格影响惩罚快速执行交易的最优证券组合清算的脉冲控制问题的数值解。相应的动态规划(DP)方程是一个具有约束粘性解意义下的值函数所满足的具有偿付能力约束的拟变分不等式(QVI)。利用滞后变量跟踪交易之间的时间间隔,我们可以提供一个显式的向后数值格式的时间离散的DPQVI。该离散时间格式的收敛性由粘性解参数来证明。一个最佳的量化方法是用于计算(条件)的期望在这个计划中产生的。数值结果提出了通过检查最优清算策略的行为,和比较性能分析与一些基准执行策略。我们还说明了我们的最佳清算算法的真实数据,并观察到各种有趣的订单执行策略的模式。最后,我们提供了一些数值测试的灵敏度方面的出价/要价价差和市场冲击参数。

英文摘要:

This paper deals with numerical solutions to an impulse control problem arising from optimal portfolio liquidation with bid-ask spread and market price impact penalizing speedy execution trades. The corresponding dynamic programming (DP) equation is a quasi-variational inequality (QVI) with solvency constraint satisfied by the value function in the sense of constrained viscosity solutions. By taking advantage of the lag variable tracking the time interval between trades, we can provide an explicit backward numerical scheme for the time discretization of the DPQVI. The convergence of this discrete-time scheme is shown by viscosity solutions arguments. An optimal quantization method is used for computing the (conditional) expectations arising in this scheme. Numerical results are presented by examining the behaviour of optimal liquidation strategies, and comparative performance analysis with respect to some benchmark execution strategies. We also illustrate our optimal liquidation algorithm on real data, and observe various interesting patterns of order execution strategies. Finally, we provide some numerical tests of sensitivity with respect to the bid/ask spread and market impact parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑