A Semi-Markovian Modeling of Limit Order Markets

被引:9
|
作者
Swishchuk, Anatoliy [1 ]
Vadori, Nelson [1 ]
机构
[1] Univ Calgary, Dept Math & Stat, 2500 Univ Dr NW, Calgary, AB T2N 1N4, Canada
来源
基金
加拿大自然科学与工程研究理事会;
关键词
limit order book; Markov renewal process; semi-Markov process; diffusion limit; duration analysis; Weibull and gamma distributions; Burr distribution; EMPIRICAL-ANALYSIS; OPTIMAL EXECUTION; PRICE DYNAMICS; BOOK; FLOW;
D O I
10.1137/15M1015406
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
R. Cont and A. de Larrard [SIAM J. Financial Math., 4 (2013), pp. 1-25] introduced a tractable stochastic model for the dynamics of a limit order book, computing various quantities of interest such as the probability of a price increase or the diffusion limit of the price process. As suggested by empirical observations, we extend their framework to (1) arbitrary distributions for book events interarrival times (possibly nonexponential) and (2) both the nature of a new book event and its corresponding interarrival time depend on the nature of the previous book event. We do so by resorting to Markov renewal processes to model the dynamics of the bid and ask queues. We keep analytical tractability via explicit expressions for the Laplace transforms of various quantities of interest. We justify and illustrate our approach by calibrating our model to the five stocks Amazon, Apple, Google, Intel, Microsoft on June 21, 2012, to the 15 stocks from Deutsche Borse Group (September 23, 2013) and to CISCO asset (November 3, 2014). As in [R. Cont and A. de Larrard SIAM J. Financial Math., 4 (2013), pp. 1-25], the bid-ask spread remains constant equal to one tick, only the bid and ask queues are modeled (they are independent from each other and get reinitialized after a price change), and all orders have the same size. We discuss possible extensions of our model for the case when the spread is not fixed, including the diffusion limit of the price dynamics in this case, and we also discuss stochastic optimal control and market making problems.
引用
收藏
页码:240 / 273
页数:34
相关论文
共 50 条
  • [1] LIMIT THEOREMS FOR SEMI-MARKOVIAN PROCESSES
    SILVESTR.DS
    [J]. DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR, 1971, (11): : 987 - &
  • [2] DYNAMIC SEMI-MARKOVIAN WORKLOAD MODELING
    Sharifimehr, Nima
    Sadaoui, Samira
    [J]. ICEIS 2008: PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS, VOL DISI: DATABASES AND INFORMATION SYSTEMS INTEGRATION, 2008, : 125 - 130
  • [3] LIMIT PROPERTIES OF FUNCTIONALS ON IRREGULAR SEMI-MARKOVIAN PROCESSES
    RUZEVIC, NA
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1990, 19 (01) : 133 - 139
  • [4] Fuzzy availability modeling of a semi-markovian deteriorating system
    Verma, AK
    Srividya, A
    Gaonkar, RP
    [J]. Proceedings of the Fifteenth IASTED International Conference on Modelling and Simulation, 2004, : 46 - 49
  • [5] QUEUES WITH SEMI-MARKOVIAN ARRIVALS
    CINLAR, E
    [J]. JOURNAL OF APPLIED PROBABILITY, 1967, 4 (02) : 365 - &
  • [6] Modeling a Random Cash Flow of an Asset with a Semi-Markovian Model
    Adekambi, Franck
    [J]. DATA-DRIVEN MODELING FOR SUSTAINABLE ENGINEERING, ICEASSM 2017, 2020, 72 : 99 - 118
  • [7] Limit Theorem for A Semi-Markovian Random Walk with General Interference of Chance
    Khaniyev, Tahir
    Sevinc, Ozlem Ardic
    [J]. SAINS MALAYSIANA, 2020, 49 (04): : 919 - 928
  • [8] Advances on modeling and control of semi-Markovian switching systems: A Survey
    Zong, Guangdeng
    Qi, Wenhai
    Shi, Yang
    [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2023, 360 (16): : 12598 - 12619
  • [9] Limit distribution for a semi-Markovian random walk with Weibull distributed interference of chance
    Tülay Kesemen
    Rovshan Aliyev
    Tahir Khaniyev
    [J]. Journal of Inequalities and Applications, 2013
  • [10] Limit distribution for a semi-Markovian random walk with Weibull distributed interference of chance
    Kesemen, Tulay
    Aliyev, Rovshan
    Khaniyev, Tahir
    [J]. JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013,