Abstract

http://ssrn.com/abstract=1916369
 
 

References (10)



 
 

Citations (2)



 


 



An Efficient Lattice Algorithm for the Libor Market Model


Tim Xiao


Risk Models, BMO Capital Markets

June 18, 2011

Journal of Derivatives, Forthcoming

Abstract:     
The LIBOR Market Model (LMM or BGM) has become one of the most popular models for pricing interest rate products. It is commonly believed that Monte-Carlo simulation is the only viable method available for the LIBOR Market Model. In this article, however, we propose a lattice (or tree) approach to price interest rate products within the LIBOR Market Model by introducing a shifted forward measure and several novel fast drift approximation methods. This model should achieve the best performance without losing much accuracy. Moreover, the calibration is almost automatic and it is simple and easy to implement. Adding this model to the valuation toolkit is actually quite useful; especially for risk management or in the case there is a need for a quick turnaround.

Number of Pages in PDF File: 31

Keywords: LIBOR Market Model, LMM lattice or tree, BGM lattice or tree, shifted forward measure, drift approximation, risk management, calibration, callable exotics, callable bond, callable capped floater swap, callable inverse floater swap, callable range accrual swap

JEL Classification: G1, C5, C6, F1

Accepted Paper Series


Download This Paper

Date posted: August 26, 2011 ; Last revised: September 25, 2011

Suggested Citation

Xiao, Tim, An Efficient Lattice Algorithm for the Libor Market Model (June 18, 2011). Journal of Derivatives, Forthcoming. Available at SSRN: http://ssrn.com/abstract=1916369

Contact Information

Tim Xiao (Contact Author)
Risk Models, BMO Capital Markets ( email )
Canada
Feedback to SSRN


Paper statistics
Abstract Views: 772
Downloads: 192
Download Rank: 91,022
References:  10
Citations:  2

© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollo3 in 0.344 seconds