Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 73 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 109 tok/s Pro
Kimi K2 194 tok/s Pro
GPT OSS 120B 421 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

On a Monotone Dynamic Approach to Optimal Stopping Problems for Continuous-Time Markov Chains (1904.10685v1)

Published 24 Apr 2019 in math.PR

Abstract: This paper is concerned with the solution of the optimal stopping problem associated to the valuation of Perpetual American options driven by continuous time Markov chains. We introduce a new dynamic approach for the numerical pricing of this type of American options where the main idea is to build a monotone sequence of almost excessive functions that are associated to hitting times of explicit sets. Under minimal assumptions about the payoff and the Markov chain, we prove that the value function of an American option is characterized by the limit of this monotone sequence.

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube