Parallel Binomial American Option Pricing with (and without) Transaction Costs
AbstractWe present a parallel algorithm that computes the ask and bid prices of an American option when proportional transaction costs apply to the trading of the underlying asset. The algorithm computes the prices on recombining binomial trees, and is designed for modern multi-core processors. Although parallel option pricing has been well studied, none of the existing approaches takes transaction costs into consideration. The algorithm that we propose partitions a binomial tree into blocks. In any round of computation a block is further partitioned into regions which are assigned to distinct processors. To minimise load imbalance the assignment of nodes to processors is dynamically adjusted before each new round starts. Synchronisation is required both within a round and between two successive rounds. The parallel speedup of the algorithm is proportional to the number of processors used. The parallel algorithm was implemented in C/C++ via POSIX Threads, and was tested on a machine with 8 processors. In the pricing of an American put option, the parallel speedup against an efficient sequential implementation was 5.26 using 8 processors and 1500 time steps, achieving a parallel efficiency of 65.75%.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by arXiv.org in its series Papers with number 1110.2477.
Date of creation: Oct 2011
Date of revision:
Contact details of provider:
Web page: http://arxiv.org/
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-10-22 (All new papers)
- NEP-CIS-2011-10-22 (Confederation of Independent States)
- NEP-CMP-2011-10-22 (Computational Economics)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Stylianos PERRAKIS & Jean LEFOLL, 1999.
"Option Pricing and Replication with Transaction Costs and Dividends,"
FAME Research Paper Series, International Center for Financial Asset Management and Engineering
rp8, International Center for Financial Asset Management and Engineering.
- Perrakis, Stylianos & Lefoll, Jean, 2000. "Option pricing and replication with transaction costs and dividends," Journal of Economic Dynamics and Control, Elsevier, Elsevier, vol. 24(11-12), pages 1527-1561, October.
- Boyle, Phelim P & Vorst, Ton, 1992. " Option Replication in Discrete Time with Transaction Costs," Journal of Finance, American Finance Association, American Finance Association, vol. 47(1), pages 271-93, March.
- Black, Fischer & Scholes, Myron S, 1973. "The Pricing of Options and Corporate Liabilities," Journal of Political Economy, University of Chicago Press, University of Chicago Press, vol. 81(3), pages 637-54, May-June.
- Schwartz, Eduardo S., 1977. "The valuation of warrants: Implementing a new approach," Journal of Financial Economics, Elsevier, Elsevier, vol. 4(1), pages 79-93, January.
- Perrakis, Stylianos & Lefoll, Jean, 1997. "Derivative Asset Pricing with Transaction Costs: An Extension," Computational Economics, Society for Computational Economics, Society for Computational Economics, vol. 10(4), pages 359-76, November.
- Perrakis, Stylianos & Lefoll, Jean, 2004. "The American put under transactions costs," Journal of Economic Dynamics and Control, Elsevier, Elsevier, vol. 28(5), pages 915-935, February.
- Bernard Bensaid & Jean-Philippe Lesne & Henri PagÃ¨s & JosÃ© Scheinkman, 1992. "Derivative Asset Pricing With Transaction Costs," Mathematical Finance, Wiley Blackwell, Wiley Blackwell, vol. 2(2), pages 63-86.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).
If references are entirely missing, you can add them using this form.