2018
DOI: 10.1080/17442508.2018.1541991
|View full text |Cite
|
Sign up to set email alerts
|

A general method for finding the optimal threshold in discrete time

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 36 publications
0
6
0
Order By: Relevance
“…Villeneuve () gives sufficient conditions to have threshold optimal strategies, and Arkin () gives necessary and sufficient conditions for Itô diffusions with C 2 payoffs functions to have one‐sided solutions, whereas Arkin and Slastnikov () and Crocce and Mordecki () give also necessary and sufficient conditions in different and more general diffusion frameworks. For more general Markov processes, Christensen and Irle (), Christensen, Salminen, and Ta (), and Mordecki and Salminen () propose verification results for one‐sided solutions, but also for problems where the optimal stopping time is of the form τ=inffalse{t00pt:X(t)(x,x)false}.…”
Section: Introductionmentioning
confidence: 99%
“…Villeneuve () gives sufficient conditions to have threshold optimal strategies, and Arkin () gives necessary and sufficient conditions for Itô diffusions with C 2 payoffs functions to have one‐sided solutions, whereas Arkin and Slastnikov () and Crocce and Mordecki () give also necessary and sufficient conditions in different and more general diffusion frameworks. For more general Markov processes, Christensen and Irle (), Christensen, Salminen, and Ta (), and Mordecki and Salminen () propose verification results for one‐sided solutions, but also for problems where the optimal stopping time is of the form τ=inffalse{t00pt:X(t)(x,x)false}.…”
Section: Introductionmentioning
confidence: 99%
“…After the present paper had been submitted, a referee brought to our attention the article by Christensen and Irle [5]. (Note that both [5] and the original version [14] of the present paper were posted on arxiv in October 2017.) The authors proposed a general method for finding the optimal threshold for discrete-time optimal stopping problems with general underlying Markov processes {X n } n≥0 .…”
Section: Discussionmentioning
confidence: 99%
“…After the present paper had been submitted, a referee brought to our attention the article by Christensen and Irle [5]. (Note that both [5] and the original version [14] of the present paper were posted on arxiv in October 2017.)…”
Section: Discussionmentioning
confidence: 99%
“…Each regression model comprised of a threshold model, u = g(a j ),u j with u denoting the thresholds, and g(a j ) a linear function with parameters a j . Following the nature of the questions, a symmetric structure was specified for the threshold parameters so that only two parameters (a j ) had to be estimated, the central threshold, and a spacing between the response levels we determined (Christensen and Irle 2019); and a group effect with the coefficient of b 1 representing the difference of group 2 (without facilitated dialogue) relative to group 1 (with facilitated dialogue). This group difference thus represents an estimation of the influence of characteristics that are different in the two groups on the two questions we investigate.…”
Section: Pre and Post Demo Surveysmentioning
confidence: 99%