Solution of Optimal Stopping Problem Based on a Modification of Payoff Function

2014 ◽  
pp. 505-517 ◽  
Author(s):  
Ernst Presman
Keyword(s):  
Optimal Stopping ◽  
Payoff Function ◽  
Optimal Stopping Problem

Optimal Stopping Time for Geometric Random Walks with Power Payoff Function

2020 ◽  
Vol 81 (7) ◽  
pp. 1192-1210
Author(s):  
O.V. Zverev ◽  
V.M. Khametov ◽  
E.A. Shelemekh
Keyword(s):  
Random Walks ◽  
Optimal Stopping ◽  
Stopping Time ◽  
Payoff Function ◽  
Optimal Stopping Time

scholarly journals On a simple optimal stopping problem

1973 ◽  
Vol 5 (4) ◽  
pp. 297-312 ◽  
Author(s):  
William M. Boyce
Keyword(s):  
Optimal Stopping ◽  
Optimal Stopping Problem

On the threshold strategies in optimal stopping problems for diffusion processes

2017 ◽  
Vol 54 (3) ◽  
pp. 963-969 ◽  
Author(s):  
Vadim Arkin ◽  
Alexander Slastnikov
Keyword(s):  
Diffusion Process ◽  
Optimal Stopping ◽  
Diffusion Processes ◽  
Sufficient Conditions ◽  
Payoff Function ◽  
Threshold Strategy ◽  
One Dimensional ◽  
Stopping Set ◽  
Optimal Stopping Problems ◽  
Necessary And Sufficient

Abstract We study a problem when the optimal stopping for a one-dimensional diffusion process is generated by a threshold strategy. Namely, we give necessary and sufficient conditions (on the diffusion process and the payoff function) under which a stopping set has a threshold structure.

A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping

2014 ◽  
Vol 51 (03) ◽  
pp. 885-889 ◽  
Author(s):  
Tomomi Matsui ◽  
Katsunori Ano
Keyword(s):  
Lower Bound ◽  
Optimal Stopping ◽  
Secretary Problem ◽  
Bernoulli Trials ◽  
Optimal Stopping Problem ◽  
Maximum Probability ◽  
Optimal Stopping Rule ◽  
Optimal Probability ◽  
Optimal Stopping Theory ◽  
Special Case

In this note we present a bound of the optimal maximum probability for the multiplicative odds theorem of optimal stopping theory. We deal with an optimal stopping problem that maximizes the probability of stopping on any of the last m successes of a sequence of independent Bernoulli trials of length N, where m and N are predetermined integers satisfying 1 ≤ m < N. This problem is an extension of Bruss' (2000) odds problem. In a previous work, Tamaki (2010) derived an optimal stopping rule. We present a lower bound of the optimal probability. Interestingly, our lower bound is attained using a variation of the well-known secretary problem, which is a special case of the odds problem.

The Optimal Stopping Problem

1969 ◽  
pp. 87-145
Author(s):  
Evgenii B. Dynkin ◽  
Aleksandr A. Yushkevich
Keyword(s):  
Optimal Stopping ◽  
Optimal Stopping Problem
Sign in / Sign up

Export Citation Format

Share Document