论文标题
在部分信息和数值方法下,使用应用程序的脉冲控制游戏的最佳市场制作
Optimal market making under partial information and numerical methods for impulse control games with applications
论文作者
论文摘要
本论文中处理的主题本质上是两个方面。第一部分认为,做市商在有限的时间范围内最佳设定出价/询问行情的问题,以最大程度地提高她的预期公用事业。她收到的订单的强度不仅取决于她引用的点差,还取决于由隐藏的马尔可夫链建立的不可观察的因素。通过随机过滤,控制和PDMPS理论来解决部分信息下的随机控制问题。该值函数的特征是其动态编程方程的唯一连续粘度解决方案,并将其与其完整信息对应物进行比较。当确切的市场制度未知时,最佳的完整信息点差显示出偏见,因为做市商需要根据PNL敏感性和可观察到的顺序流动率调整额外的制度不确定性。 第二部分涉及数值求解非零的随机冲动控制游戏。这些提供了一个现实且深远的建模框架,但是解决此类问题的困难阻碍了它们的扩散。提出了一个策略题型求解器来求解基本的准差异不平等系统,并以令人放心的结果对其进行了数值验证。 最终,将重点放在具有对称结构的游戏上,并提出了改进的算法。对玩家策略进行了自然的假设进行了严格的融合分析,该假设在弱链条的对角矩阵的背景下接受图理论解释。该算法用于以高精度的平衡回报和其他挑战性问题的纳什均衡来计算,甚至有些结果超出了当前可用理论的范围。
The topics treated in this thesis are inherently two-fold. The first part considers the problem of a market maker optimally setting bid/ask quotes over a finite time horizon, to maximize her expected utility. The intensities of the orders she receives depend not only on the spreads she quotes, but also on unobservable factors modelled by a hidden Markov chain. This stochastic control problem under partial information is solved by means of stochastic filtering, control and PDMPs theory. The value function is characterized as the unique continuous viscosity solution of its dynamic programming equation and numerically compared with its full information counterpart. The optimal full information spreads are shown to be biased when the exact market regime is unknown, as the market maker needs to adjust for additional regime uncertainty in terms of PnL sensitivity and observable order flow volatility. The second part deals with numerically solving nonzero-sum stochastic impulse control games. These offer a realistic and far-reaching modelling framework, but the difficulty in solving such problems has hindered their proliferation. A policy-iteration-type solver is proposed to solve an underlying system of quasi-variational inequalities, and it is validated numerically with reassuring results. Eventually, the focus is put on games with a symmetric structure and an improved algorithm is put forward. A rigorous convergence analysis is undertaken with natural assumptions on the players strategies, which admit graph-theoretic interpretations in the context of weakly chained diagonally dominant matrices. The algorithm is used to compute with high precision equilibrium payoffs and Nash equilibria of otherwise too challenging problems, and even some for which results go beyond the scope of the currently available theory.