Convex optimization provides a natural framework for pricing and hedging financial instruments in incomplete market models. Duality theory of convex optimization has been shown to yield elementary proofs of well-known martingale-expressions for prices of European contingent claims. This paper extends the analysis to American contingent claims in incomplete markets. The pricing problems of the seller and the buyer of an American contingent claim are first expressed as convex optimizatin problems, after which martingale-expressions for the the buyer's and seller's prices are obtained by inispecting the dual optimization problems. Besides its simplicity, one of the main advantages of the present approach is that it is computational. Indeed, many algorithms are available for pricing problems as soon as they are set up as convex optimization problems. Also, portfolio constraints and transaction costs can be immediately incorporated to the definitions of the buyer's and seller's prices and into computational approaches based on optimization.
By: Teemu Pennanen, Alan King
Published in: RC23158 in 2004
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .