Abstract
In this paper, we develop an efficient algorithm to value options under discrete-time GARCH processes. We propose a procedure based on dynamic programming coupled with piecewise polynomial approximation to compute the value of a given option, at all observation dates and levels of the state vector. The method can be used for the large GARCH family of models based on Gaussian innovations and may accommodate all low-dimensional European as well as American derivatives. Numerical implementations show that this method competes very advantageously with other available valuation methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
