Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Binomial options pricing model
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Numerical method for the valuation of financial options}} In [[finance]], the '''binomial options pricing model''' ('''BOPM''') provides a generalizable [[Numerical analysis|numerical method]] for the valuation of [[Option (finance)|options]]. Essentially, the model uses a "discrete-time" ([[Lattice model (finance)|lattice based]]) model of the varying price over time of the [[underlying]] financial instrument, addressing cases where the [[Closed-form expression|closed-form]] [[BlackāScholes formula]] is wanting, which in general does not exist for the '''BOPM'''.<ref>{{Cite journal |last=Georgiadis |first=Evangelos |title=Binomial options pricing has no closed-form solution |journal=Algorithmic Finance |date=2011 |volume=1 |issue=1 |pages=11ā18 |doi=10.3233/AF-2011-003 |publisher=IOS Press}}</ref> The binomial model was first proposed by [[William F. Sharpe|William Sharpe]] in the 1978 edition of ''Investments'' ({{ISBN|013504605X}}),<ref>[https://www.nobelprize.org/prizes/economic-sciences/1990/sharpe/biographical/ William F. Sharpe, Biographical], nobelprize.org</ref> and formalized by [[John Carrington Cox|Cox]], [[Stephen Ross (economist)|Ross]] and [[Mark Rubinstein|Rubinstein]] in 1979<ref>{{Cite journal |last1=Cox |first1=J. C. |authorlink1=John Carrington Cox |last2=Ross |first2=S. A. |authorlink2=Stephen Ross (economist)|last3=Rubinstein |first3=M. |authorlink3=Mark Rubinstein|doi=10.1016/0304-405X(79)90015-1 |title=Option pricing: A simplified approach |journal=[[Journal of Financial Economics]]|volume=7 |issue=3 |page=229 |year=1979|citeseerx=10.1.1.379.7582 }}</ref> and by Rendleman and Bartter in that same year.<ref>Richard J. Rendleman, Jr. and Brit J. Bartter. 1979. "Two-State Option Pricing". ''[[Journal of Finance]]'' 24: 1093-1110. {{doi|10.2307/2327237}}</ref> For binomial trees as applied to [[fixed income]] and [[interest rate derivatives]] see {{section link|Lattice model (finance) #Interest rate derivatives}}. ==Use of the model== The Binomial options pricing model approach has been widely used since it is able to handle a variety of conditions for which other models cannot easily be applied. This is largely because the BOPM is based on the description of an [[underlying instrument]] over a period of time rather than a single point. As a consequence, it is used to value [[American option]]s that are exercisable at any time in a given interval as well as [[Bermudan option]]s that are exercisable at specific instances of time. Being relatively simple, the model is readily implementable in computer [[software]] (including a [[spreadsheet]]). Although higher in computational complexity and computationally slower than the [[BlackāScholes model|BlackāScholes formula]], it is more accurate, particularly for longer-dated options on securities with [[dividend]] payments. For these reasons, various versions of the binomial model are widely used by practitioners in the options markets.{{Citation needed|date=May 2016}} For options with several sources of uncertainty (e.g., [[real option]]s) and for options with complicated features (e.g., [[Asian option]]s), binomial methods are less practical due to several difficulties, and [[Monte Carlo option model]]s are commonly used instead. When simulating a small number of time steps [[Monte Carlo simulation]] will be more computationally time-consuming than BOPM (cf. [[Monte Carlo methods in finance]]). However, the worst-case runtime of BOPM will be [[Exponential time|O(2<sup>n</sup>)]], where n is the number of time steps in the simulation. Monte Carlo simulations will generally have a [[Polynomial time|polynomial time complexity]], and will be faster for large numbers of simulation steps. [[Monte Carlo simulation]]s are also less susceptible to sampling errors, since binomial techniques use discrete time units. This becomes more true the smaller the discrete units become. ==Method== [[File:Arbre Binomial Options Reelles.png|500px|right|Binomial Lattice with CRR formulae]] {| class="wikitable floatright" | width="500" |- | '''function''' americanPut(T, S, K, r, sigma, q, n) { {{gray|' T... expiration time ' S... stock price ' K... strike price ' r... interest rate ' sigma... volatility of the stock price ' q... dividend yield ' n... height of the binomial tree}} deltaT := T / n; up := exp(sigma * sqrt(deltaT)); p0 := (up * exp(-q * deltaT) - exp(-r * deltaT)) / (up^2 - 1); p1 := exp(-r * deltaT) - p0; {{gray|' initial values at time T}} '''for''' i := 0 '''to''' n { p[i] := K - S * up^(2*i - n+1); '''if''' p[i] < 0 '''then''' p[i] := 0; } {{gray|' move to earlier times}} '''for''' j := n-1 '''down to''' 0 { '''for''' i := 0 '''to''' j { {{gray|' binomial value}} p[i] := p0 * p[i+1] + p1 * p[i]; {{gray|' exercise value}} exercise := K - S * up^(2*i - j+1); '''if''' p[i] < exercise '''then''' p[i] := exercise; } } '''return''' americanPut := p[0]; } |} The binomial pricing model traces the evolution of the option's key underlying variables in discrete-time. This is done by means of a binomial lattice (Tree), for a number of time steps between the valuation and expiration dates. Each node in the lattice represents a possible price of the underlying at a given point in time. Valuation is performed iteratively, starting at each of the final nodes (those that may be reached at the time of expiration), and then [[Backward induction|working backwards]] through the tree towards the first node (valuation date). The value computed at each stage is the value of the option at that point in time. Option valuation using this method is, as described, a three-step process: # Price tree generation, # Calculation of option value at each final node, # Sequential calculation of the option value at each preceding node. ===Step 1: Create the binomial price tree=== The tree of prices is produced by working forward from valuation date to expiration. At each step, it is assumed that the [[underlying instrument]] will move up or down by a specific factor (<math>u</math> or <math>d</math>) per step of the tree (where, by definition, <math>u \ge 1</math> and <math>0 < d \le 1 </math>). So, if <math>S</math> is the current price, then in the next period the price will either be <math>S_{up} = S \cdot u</math> or <math>S_{down} = S \cdot d</math>. The up and down factors are calculated using the underlying (fixed) [[Volatility (finance)|volatility]], <math>\sigma</math>, and the time duration of a step, <math>t</math>, measured in years (using the [[day count convention]] of the underlying instrument). From the condition that the [[variance]] of the log of the price is <math>\sigma^2 t</math>, we have: :<math>u = e^{\sigma\sqrt \Delta t}</math> :<math>d = e^{-\sigma\sqrt \Delta t} = \frac{1}{u}.</math> Above is the original Cox, Ross, & Rubinstein (CRR) method; there are various other techniques for generating the lattice, such as "the equal probabilities" tree, see.<ref name="Joshi">Mark s. Joshi (2008). [http://fbe.unimelb.edu.au/__data/assets/pdf_file/0006/806280/170.pdf The Convergence of Binomial Trees for Pricing the American Put]</ref><ref name="Chance"/> The CRR method ensures that the tree is recombinant, i.e. if the underlying asset moves up and then down (u,d), the price will be the same as if it had moved down and then up (d,u)āhere the two paths merge or recombine. This property reduces the number of tree nodes, and thus accelerates the computation of the option price. This property also allows the value of the underlying asset at each node to be calculated directly via formula, and does not require that the tree be built first. The node-value will be: :<math>S_n = S_0 \times u ^{N_u - N_d},</math> Where <math>N_u</math> is the number of up ticks and <math>N_d</math> is the number of down ticks. ===Step 2: Find option value at each final node=== At each final node of the treeāi.e. at expiration of the optionāthe option value is simply its [[option time value|intrinsic]], or exercise, value: :{{math|[[Extreme value|Max]] [ (''S{{sub|n}} ''− ''K''), 0 ]}}, for a [[call option]] :{{math|Max [ (''K'' ā ''S{{sub|n}}''), 0 ]}}, for a [[put option]], Where {{mvar|K}} is the [[strike price]] and <math>S_n</math> is the spot price of the underlying asset at the {{mvar|n}}{{sup|th}} period. ===Step 3: Find option value at earlier nodes=== Once the above step is complete, the option value is then found for each node, starting at the penultimate time step, and working back to the first node of the tree (the valuation date) where the calculated result is the value of the option. In overview: the "binomial value" is found at each node, using the [[risk-neutral measure|risk neutrality]] assumption; see [[Rational pricing#Risk neutral valuation|Risk neutral valuation]]. If exercise is permitted at the node, then the model takes the greater of binomial and exercise value at the node. The steps are as follows: {{ordered list|1= Under the risk neutrality assumption, today's [[fair value|fair price]] of a [[derivative (finance)|derivative]] is equal to the [[expected value]] of its future payoff discounted by the [[Risk-free interest rate|risk free rate]]. Therefore, expected value is calculated using the option values from the later two nodes (''Option up'' and ''Option down'') weighted by their respective (fixed) probabilitiesā"probability" '''p''' of an up move in the underlying, and "probability" '''(1āp)''' of a down move. The expected value is then discounted at '''r''', the [[Risk-free interest rate|risk free rate]] corresponding to the life of the option. :The following formula to compute the [[expectation value]] is applied at each node: :<math>\text { Binomial Value }=[p \times \text { Option up }+(1-p) \times \text { Option down] } \times \exp (-r \times \Delta t)</math>, or :<math>C_{t-\Delta t,i} = e^{-r \Delta t}(pC_{t,i} + (1-p)C_{t,i+1}) \,</math> :where :<math>C_{t,i} \,</math> is the option's value for the <math>i^{th} \,</math> node at time {{mvar|t}}, :<math>p = \frac{e^{(r-q) \Delta t} - d}{u - d}</math> is chosen such that the related [[binomial distribution]] simulates the [[geometric Brownian motion]] of the underlying stock with parameters '''r''' and '''Ļ''', :{{mvar|q}} is the [[dividend yield]] of the underlying corresponding to the life of the option. It follows that in a risk-neutral world futures price should have an expected growth rate of zero and therefore we can consider <math>q=r</math> for futures. :Note that for {{mvar|p}} to be in the interval <math>(0,1)</math> the following condition on <math>\Delta t</math> has to be satisfied <math>\Delta t < \frac{\sigma^2}{(r-q)^2}</math>. :(Note that the alternative valuation approach, [[arbitrage-free]] pricing, yields identical results; see ā[[Rational pricing#Delta hedging|delta-hedging]]ā.) |2= This result is the "Binomial Value". It represents the fair price of the derivative at a particular point in time (i.e. at each node), given the evolution in the price of the underlying to that point. It is the value of the option if it were to be heldāas opposed to exercised at that point. |3= Depending on the style of the option, evaluate the possibility of early exercise at each node: if (1) the option can be exercised, and (2) the exercise value exceeds the Binomial Value, then (3) the value at the node is the exercise value. * For a [[European option]], there is no option of early exercise, and the binomial value applies at all nodes. * For an [[American option]], since the option may either be held or exercised prior to expiry, the value at each node is: Max (Binomial Value, Exercise Value). * For a [[Bermudan option]], the value at nodes where early exercise is allowed is: Max (Binomial Value, Exercise Value); at nodes where early exercise is not allowed, only the binomial value applies. }} In calculating the value at the next time step calculatedāi.e. one step closer to valuationāthe model must use the value selected here, for "Option up"/"Option down" as appropriate, in the formula at the node. The aside [[algorithm]] demonstrates the approach computing the price of an American put option, although is easily generalized for calls and for European and Bermudan options: ==Relationship with BlackāScholes== Similar [[BlackāScholes#The model|assumptions]] underpin both the binomial model and the [[BlackāScholes|BlackāScholes model]], and the binomial model thus provides a [[Discrete time and continuous time|discrete time]] [[approximation]] to the continuous process underlying the BlackāScholes model. The binomial model assumes that movements in the price follow a [[binomial distribution]]; for many trials, this binomial distribution approaches the [[log-normal distribution]] assumed by BlackāScholes. In this case then, for [[European option]]s without dividends, the binomial model value converges on the BlackāScholes formula value as the number of time steps increases.<ref name="Joshi" /><ref name="Chance">Chance, Don M. March 2008 [http://www.henley.ac.uk/web/files/rep/binomial_option.pdf ''A Synthesis of Binomial Option Pricing Models for Lognormally Distributed Assets''] {{Webarchive|url=https://web.archive.org/web/20160304023210/http://www.henley.ac.uk/web/files/rep/binomial_option.pdf |date=2016-03-04 }}. Journal of Applied Finance, Vol. 18</ref> In addition, when analyzed as a numerical procedure, the CRR binomial method can be viewed as a [[special case]] of the [[Finite difference method#Explicit method|explicit finite difference method]] for the BlackāScholes [[Partial differential equation|PDE]]; see [[finite difference methods for option pricing]].<ref>{{cite journal|last=Rubinstein |first=M. |year=2000 |title=On the Relation Between Binomial and Trinomial Option Pricing Models |journal=[[Journal of Derivatives]] |volume=8 |issue=2 |pages=47ā50 |url=//www.in-the-money.com/pages/author.htm |doi=10.3905/jod.2000.319149 |url-status=dead |archive-url=https://web.archive.org/web/20070622150346/http://www.in-the-money.com/pages/author.htm |archive-date=June 22, 2007 |citeseerx=10.1.1.43.5394 |s2cid=11743572 }}</ref> ==See also== * [[Trinomial tree]], a similar model with three possible paths per node. * [[Tree (data structure)]] * [[Lattice model (finance)]], for more general discussion and application to other underlyings * [[BlackāScholes model|BlackāScholes]]: binomial lattices are able to handle a variety of conditions for which BlackāScholes cannot be applied. * [[Monte Carlo option model]], used in the valuation of options with complicated features that make them difficult to value through other methods. * [[Real options analysis]], where the BOPM is widely used. * [[Quantum finance]], quantum binomial pricing model. * [[Mathematical finance]], which has a list of related articles. * {{section link|Employee stock option#Valuation}}, where the BOPM is widely used. * [[Implied binomial tree]] * [[Edgeworth binomial tree]] ==References== {{reflist}} ==External links== * [http://www.sjsu.edu/faculty/watkins/binomial.htm The Binomial Model for Pricing Options], Prof. Thayer Watkins *[http://tv-prod.s3.amazonaws.com/documents%2Fnull-Binomial+Option+Pricing+_f-0943_.pdf Binomial Option Pricing] ([[PDF]]), Prof. Robert M. Conroy * [http://demonstrations.wolfram.com/BinomialOptionPricingModel/ Binomial Option Pricing Model] by Fiona Maclachlan, [[The Wolfram Demonstrations Project]] * [http://ssrn.com/abstract=844104 On the Irrelevance of Expected Stock Returns in the Pricing of Options in the Binomial Model: A Pedagogical Note] by Valeri Zakamouline * [https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2428763 A Simple Derivation of Risk-Neutral Probability in the Binomial Option Pricing Model] by Greg Orosi {{Derivatives market}} [[Category:Financial models]] [[Category:Options (finance)]] [[Category:Mathematical finance]] [[Category:Models of computation]] [[Category:Trees (data structures)]] [[Category:Articles with example code]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Citation needed
(
edit
)
Template:Cite journal
(
edit
)
Template:Derivatives market
(
edit
)
Template:Doi
(
edit
)
Template:Gray
(
edit
)
Template:ISBN
(
edit
)
Template:Math
(
edit
)
Template:Mvar
(
edit
)
Template:Ordered list
(
edit
)
Template:Reflist
(
edit
)
Template:Section link
(
edit
)
Template:Short description
(
edit
)
Template:Sup
(
edit
)
Template:Webarchive
(
edit
)