EconPapers    
Economics at your fingertips  
 

Randomized Stopping Times and American Option Pricing with Transaction Costs

Prasad Chalasani and Somesh Jha

Mathematical Finance, 2001, vol. 11, issue 1, 33-77

Abstract: In a general discrete‐time market model with proportional transaction costs, we derive new expectation representations of the range of arbitrage‐free prices of an arbitrary American option. The upper bound of this range is called the upper hedging price, and is the smallest initial wealth needed to construct a self‐financing portfolio whose value dominates the option payoff at all times. A surprising feature of our upper hedging price representation is that it requires the use of randomized stopping times (Baxter and Chacon 1977), just as ordinary stopping times are needed in the absence of transaction costs. We also represent the upper hedging price as the optimum value of a variety of optimization problems. Additionally, we show a two‐player game where at Nash equilibrium the value to both players is the upper hedging price, and one of the players must in general choose a mixture of stopping times. We derive similar representations for the lower hedging price as well. Our results make use of strong duality in linear programming.

Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
https://doi.org/10.1111/1467-9965.00107

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:mathfi:v:11:y:2001:i:1:p:33-77

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0960-1627

Access Statistics for this article

Mathematical Finance is currently edited by Jerome Detemple

More articles in Mathematical Finance from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().

 
Page updated 2025-03-19
Handle: RePEc:bla:mathfi:v:11:y:2001:i:1:p:33-77