A general method for finding the optimal threshold in discrete time
From MaRDI portal
Publication:5087022
Abstract: We develop an approach for solving one-sided optimal stopping problems in discrete time for general underlying Markov processes on the real line. The main idea is to transform the problem into an auxiliary problem for the ladder height variables. In case that the original problem has a one-sided solution and the auxiliary problem has a monotone structure, the corresponding myopic stopping time is optimal for the original problem as well. This elementary line of argument directly leads to a characterization of the optimal boundary in the original problem: The optimal threshold is given by the threshold of the myopic stopping time in the auxiliary problem. Supplying also a sufficient condition for our approach to work, we obtain solutions for many prominent examples in the literature, among others the problems of Novikov-Shiryaev, Shepp-Shiryaev, and the American put in option pricing under general conditions. As a further application we show that for underlying random walks (and L'evy processes in continuous time), the reward functions leading to one-sided stopping problems are exactly the monotone and log-concave functions.
Recommendations
- General optimal stopping with linear cost
- One-sided solutions for optimal stopping problems with logconcave reward functions
- An effective method for the explicit solution of sequential problems on the real line
- Optimal stopping of strong Markov processes
- An elementary approach to optimal stopping problems for AR(1) sequences
Cites work
- scientific article; zbMATH DE number 3842897 (Why is no real title available?)
- scientific article; zbMATH DE number 4218072 (Why is no real title available?)
- scientific article; zbMATH DE number 5016447 (Why is no real title available?)
- scientific article; zbMATH DE number 3607222 (Why is no real title available?)
- scientific article; zbMATH DE number 1245556 (Why is no real title available?)
- scientific article; zbMATH DE number 524378 (Why is no real title available?)
- scientific article; zbMATH DE number 796443 (Why is no real title available?)
- scientific article; zbMATH DE number 3205002 (Why is no real title available?)
- scientific article; zbMATH DE number 3369559 (Why is no real title available?)
- An approach for solving perpetual optimal stopping problems driven by Lévy processes
- An effective method for the explicit solution of sequential problems on the real line
- An elementary approach to optimal stopping problems for AR(1) sequences
- Generalized parking problems for levy processes
- Introductory lectures on fluctuations of Lévy processes with applications.
- Irreversible decisions under uncertainty. Optimal stopping made easy
- Logconcave reward functions and optimal stopping rules of threshold form
- Martingales and first passage times of AR(1) sequences
- Monotone stopping problems and continuous time processes
- Monotone stopping rules forstochastic processes in a semimartingale representation with applications
- New developments of the odds theorem
- On a solution of the optimal stopping problem for processes with independent increments
- On an Effective Solution of the Optimal Stopping Problem for Random Walks
- On optimal stopping rules
- On the Novikov-Shiryaev optimal stopping problems in continuous time
- Optimal Stopping for Partial Sums
- Optimal Stopping for Processes with Independent Increments, and Applications
- Optimal stopping and perpetual options for Lévy processes
- Optimal stopping for Lévy processes with one-sided solutions
- Optimal stopping of Hunt and Lévy processes
- Optimal stopping of strong Markov processes
- Optimal stopping on autoregressive schemes
- Optimal stopping time problem for random walks with polynomial reward functions
- Optimal stopping, Appell polynomials, and Wiener-Hopf factorization
- Phase-Type Distributions and Optimal Stopping for Autoregressive Processes
- Phase-type representations in random walk and queueing problems
- Russian and American put options under exponential phase-type Lévy models.
- Some remarks on first passage of Lévy processes, the American put and pasting principles
- Submultiplicative moments of the supremum of a random walk with negative drift
- Sum the odds to one and stop
- The Russian option: Reduced regret
Cited in
(8)- The monotone case approach for the solution of certain multidimensional optimal stopping problems
- Logconcave reward functions and optimal stopping rules of threshold form
- A note on one-sided solutions for optimal stopping problems driven by Lévy processes
- A New (t,n) −Threshold Scheme Based on Difference Equations
- A general approximation method for optimal stopping and random delay
- An effective method for the explicit solution of sequential problems on the real line
- One-sided solutions for optimal stopping problems with logconcave reward functions
- General optimal stopping with linear cost
This page was built for publication: A general method for finding the optimal threshold in discrete time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087022)
