Skip navigation
Please use this identifier to cite or link to this item:
Title: The computational hardness of pricing compound securities
Authors: Pasricha, Kanika
Advisors: Braverman, Mark
Department: Electrical Engineering
Class Year: 2013
Abstract: It is generally assumed that you can make a financial asset out of any underlying event or combination thereof, and then sell a security. We want to show that while this is theoretically true from the financial engineering perspective, compound securities might be intractable to price. Even given no information asymmetries, or adversarial sellers, it might be impossible or very computationally intensive to put a value on these, and the associated computational complexity might afford an advantage to the party with more compute power. We have proved a PSPACE complexity bound on pricing unbounded compound options without assuming information asymmetries, and have also obtained exponentially increasing lower bounds on the number of queries required to price k-layered securities.
Extent: 38 pages
Access Restrictions: Walk-in Access. This thesis can only be viewed on computer terminals at the Mudd Manuscript Library.
Type of Material: Princeton University Senior Theses
Language: en_US
Appears in Collections:Electrical and Computer Engineering, 1932-2022

Files in This Item:
File SizeFormat 
Pasricha_Kanika.pdf317.17 kBAdobe PDF    Request a copy

Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.