DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Choe, Geon Ho | - |
dc.contributor.advisor | 최건호 | - |
dc.contributor.author | Kim, Gunhee | - |
dc.date.accessioned | 2019-08-25T02:40:47Z | - |
dc.date.available | 2019-08-25T02:40:47Z | - |
dc.date.issued | 2019 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=842150&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/264949 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 수리과학과, 2019.2,[iv, 53 p. :] | - |
dc.description.abstract | We propose a discrete and a continuous limit order book models in trading of financial assets, employing compound Poisson processes and Brownian motions with drift, and derive the distributions of future best buy and best sell prices based on the current limit order book state. To analyze short-term price movement, we compute distribution of hitting time of limit order volume processes. We suggest a method to compute an efficient price, which is an underlying (semi)martingale process of an market price process, under the limit order book models by computing the expectations of future mid price. We prove the martingale property of the efficient price under the bid-ask symmetry condition. Moreover, we check the efficiency of our models using the market data. Finally, we suggest continuous processes with a self-exciting feature which can be applied to various models including limit order books, and computed its limit properties. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Limit order book▼apoisson process▼aefficient price▼amartingale▼aself-exciting process | - |
dc.subject | 지정가 주문▼a푸와송 과정▼a유효 가격▼a마틴게일▼a자기여기 과정 | - |
dc.title | Analysis of the limit order using jump process models | - |
dc.title.alternative | 점프 과정 모델을 사용한 지정가 주문 분석 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :수리과학과, | - |
dc.contributor.alternativeauthor | 김건희 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.