2018
DOI: 10.5539/jmr.v10n6p108
|View full text |Cite
|
Sign up to set email alerts
|

Markov Chain Monte Carlo Method for Estimating Implied Volatility in Option Pricing

Abstract: Using market covered European call option prices, the Independence Metropolis-Hastings Sampler algorithm for estimating Implied volatility in option pricing was proposed. This algorithm has an acceptance criteria which facilitate accurate approximation of this volatility from an independent path in the Black Scholes Model, from a set of finite data observation from the stock market. Assuming the underlying asset indeed follow the geometric brownian motion, inverted version of the Black Scholes model was used t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…where f(X)P(Y|X) represents the likelihood of finding the system in the vicinity of state X, denoted by f(X), multiplied by the conditional probability of the system transitioning from state X to state Y, denoted by P(Y|X) (Ayekple et al, 2018). The detailed balance condition plays a crucial role in maintaining the correct distribution in the algorithm and is employed to determine the acceptance probability of proposed moves in the Metropolis-Hastings algorithm.…”
Section: Markov Chain Monte Carlo (Metropolis-hasting Algorithm)mentioning
confidence: 99%
See 1 more Smart Citation
“…where f(X)P(Y|X) represents the likelihood of finding the system in the vicinity of state X, denoted by f(X), multiplied by the conditional probability of the system transitioning from state X to state Y, denoted by P(Y|X) (Ayekple et al, 2018). The detailed balance condition plays a crucial role in maintaining the correct distribution in the algorithm and is employed to determine the acceptance probability of proposed moves in the Metropolis-Hastings algorithm.…”
Section: Markov Chain Monte Carlo (Metropolis-hasting Algorithm)mentioning
confidence: 99%
“…The balance condition ensures that the desired distribution π(•) is the stationary distribution of the Markov chain. In other words, as the Markov chain converges, the distribution of states should approach the desired distribution π(•) (Ayekple et al, 2018). The balance condition is satisfied when the acceptance probability α(X,Y) is defined as α(X,Y) = min{1, π(Y)/π(X)}.…”
Section: Markov Chain Monte Carlo (Metropolis-hasting Algorithm)mentioning
confidence: 99%