Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 102 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 30 tok/s
GPT-5 High 27 tok/s Pro
GPT-4o 110 tok/s
GPT OSS 120B 475 tok/s Pro
Kimi K2 203 tok/s Pro
2000 character limit reached

The American Put Option with A Random Time Horizon (2211.13918v4)

Published 25 Nov 2022 in math.PR and math.OC

Abstract: This paper is intended to provide a unique valuation formula for the American put option in a random time horizon; more precisely, such option restricts any stopping rules to be made before the last exit time of the price of the underlying assets at any fixed level. By exploiting the theory of enlargement of filtrations associated with random times, this pricing problem can be transformed into an equivalent optimal stopping problem with a semi-continuous, time-dependent gain function whose partial derivative is singular at certain point. The difficulties in establishing the monotonicity of the optimal stopping boundary and the regularity of the value function lie essentially in these somewhat unpleasant features of the gain function. However, it turns out that a successful analysis of the continuation and stopping sets with proper assumption can help us overcome these difficulties and obtain the important properties that possessed by the free-boundary, which eventually leads us to the desired free-boundary problem. After this, the nonlinear integral equations that characterise the free-boundary and the value function can be derived. The solution to these equations are examined in details.

Citations (1)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)