Discrete-Time Pricing and Optimal Exercise of American Perpetual Warrants in the Geometric Random Walk Model

被引:0
|
作者
Robert J. Vanderbei
Mustafa Ç. Pınar
Efe B. Bozkaya
机构
[1] Princeton University,Department of Operations Research and Financial Engineering
[2] Bilkent University,Department of Industrial Engineering
[3] Sabancı University,Faculty of Administrative Sciences
来源
关键词
American perpetual warrants; Pricing; Optimal stopping; Optimal exercise; Random walk; Linear programming; Duality;
D O I
暂无
中图分类号
学科分类号
摘要
An American option (or, warrant) is the right, but not the obligation, to purchase or sell an underlying equity at any time up to a predetermined expiration date for a predetermined amount. A perpetual American option differs from a plain American option in that it does not expire. In this study, we solve the optimal stopping problem of a perpetual American option (both call and put) in discrete time using linear programming duality. Under the assumption that the underlying stock price follows a discrete time and discrete state Markov process, namely a geometric random walk, we formulate the pricing problem as an infinite dimensional linear programming (LP) problem using the excessive-majorant property of the value function. This formulation allows us to solve complementary slackness conditions in closed-form, revealing an optimal stopping strategy which highlights the set of stock-prices where the option should be exercised. The analysis for the call option reveals that such a critical value exists only in some cases, depending on a combination of state-transition probabilities and the economic discount factor (i.e., the prevailing interest rate) whereas it ceases to be an issue for the put.
引用
收藏
页码:97 / 122
页数:25
相关论文
共 50 条
  • [31] Discrete-time dynamic road congestion pricing under stochastic user optimal principle
    Han, Linghui
    Zhu, Chengjuan
    Wang, David Z. W.
    Sun, Huijun
    Tan, Zhijia
    Meng, Meng
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2019, 131 : 24 - 36
  • [32] Quasi-optimal model reduction of discrete-time systems
    Brehonnet, P
    Derrien, A
    Vilbe, P
    Calvez, LC
    ELECTRONICS LETTERS, 1996, 32 (16) : 1521 - 1522
  • [33] Stable optimal model reduction of linear discrete-time systems
    Puri, NN
    Lim, MT
    JOURNAL OF DYNAMIC SYSTEMS MEASUREMENT AND CONTROL-TRANSACTIONS OF THE ASME, 1997, 119 (02): : 300 - 304
  • [34] Quasi-optimal model reduction of discrete-time systems
    Universite de Bretagne Occidentale, , Brest, France
    Electron Lett, 16 (1521-1522):
  • [35] A discrete-time model for the optimal management of an insurance asset portfolio
    Han, Junxia
    Gao, Junshan
    Proceedings of the 2005 Conference of System Dynamics and Management Science, Vol 1: SUSTAINABLE DEVELOPMENT OF ASIA PACIFIC, 2005, : 506 - 510
  • [36] A method for the assessment of the optimal parameter of discrete-time switch model
    Razzaghi, R.
    Foti, C.
    Paolone, M.
    Rachidi, F.
    ELECTRIC POWER SYSTEMS RESEARCH, 2014, 115 : 80 - 86
  • [37] Coarse-graining of asymmetric discrete-time random walk on a one-dimensional lattice
    Kalnin, Juris P.
    Berezhkovskii, Alexander M.
    JOURNAL OF CHEMICAL PHYSICS, 2019, 151 (22):
  • [38] Experimental implementation of a discrete-time quantum random walk on an NMR quantum-information processor
    Ryan, CA
    Laforest, M
    Boileau, JC
    Laflamme, R
    PHYSICAL REVIEW A, 2005, 72 (06):
  • [39] WHEN DOES A DISCRETE-TIME RANDOM WALK IN Rn ABSORB THE ORIGIN INTO ITS CONVEX HULL?
    Tikhomirov, Konstantin
    Youssef, Pierre
    ANNALS OF PROBABILITY, 2017, 45 (02): : 965 - 1002
  • [40] Optimal control problems subject to uncertain random discrete-time noncausal systems
    Chen, Xin
    Li, Fuzhen
    Yuan, Dongmei
    Wang, Jian
    Shao, Yu
    CHAOS SOLITONS & FRACTALS, 2023, 173