arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.12776q-fin.MF
收藏

半马尔可夫与霍克斯跳扩散模型下的算法交易与高频交易问题

Algorithmic and High-Frequency Trading Problems for Semi-Markov and Hawkes Jump-Diffusion Models

Luca Lalor, Anatoliy Swishchuk

AI总结:

本文针对算法与高频交易场景,提出复合半马尔可夫与霍克斯跳扩散模型以刻画非马尔可夫的限价订单簿动态,结合扩散近似与随机最优控制求解建仓清仓的最优策略,仿真验证其可优化执行效果。

摘要:

本文提出了一种专为算法交易与高频交易(HFT)设计的跳扩散定价模型。该模型纳入了独立的跳跃过程与扩散过程,在标度极限框架下更精准地刻画了限价订单簿(LOB)的动态特性。鉴于算法交易与高频交易策略目前在主要金融市场中占据主导地位,准确建模LOB动态对开发有效的交易算法至关重要。近期研究表明,LOB数据通常呈现非马尔可夫特性,进一步凸显了对能更优捕捉其演化过程的模型的需求。本文在更具一般性的复合半马尔可夫与霍克斯跳扩散模型下,研究了资产建仓与清仓问题。我们首先构建了捕捉这类动态的跳扩散框架,随后对跳跃分量应用扩散近似,以得到稳健的解。最优交易策略通过随机最优控制(SOC)进行建模并采用数值方法求解。最后,我们开展了策略仿真,分析了价格路径、库存演化、交易速度以及平均执行价格。本研究揭示了这些模型如何在更一般的价格动态下优化执行策略。

英文摘要:

This paper introduces a jump-diffusion pricing model specifically designed for algorithmic trading and high-frequency trading (HFT). The model incorporates independent jump and diffusion processes, providing a more precise representation of the limit order book (LOB) dynamics within a scaling-limit framework. Given that algorithmic and HFT strategies now dominate major financial markets, accurately modeling LOB dynamics is crucial for developing effective trading algorithms. Recent research has shown that LOB data often exhibit non-Markovian properties, reinforcing the need for models that better capture its evolution. In this paper, we address acquisition and liquidation problems under more general compound semi-Markov and Hawkes jump-diffusion models. We first develop jump-diffusion frameworks to capture these dynamics and then apply diffusion approximations to the jump components so that robust solutions can be given. Optimal trading strategies are formulated using stochastic optimal control (SOC) and solved numerically. Finally, we present strategy simulations analyzing price paths, inventory evolution, trading speed, and average execution prices. This study provides insights into how these models can improve execution strategies under more general price dynamics.

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

↑