System Modelling and Optimization
DOI: 10.1007/bfb0008423
|View full text |Cite
|
Sign up to set email alerts
|

On some selection problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…These sets are the same as in [16] (page 685). Using the same methodology we obtain the optimal strategy: it allows us to stop only in such a moment, when observed candidate is the largest so far and exceeds the value x .…”
Section: It Leads Tomentioning
confidence: 90%
See 1 more Smart Citation
“…These sets are the same as in [16] (page 685). Using the same methodology we obtain the optimal strategy: it allows us to stop only in such a moment, when observed candidate is the largest so far and exceeds the value x .…”
Section: It Leads Tomentioning
confidence: 90%
“…In the Section 3 we consider full information duration problem (FIDP) in finite horizon with and without recall possibility. The duration problem is transformed to the optimal stopping problem for the Markov process similar to this applied by Bojdecki [2] and Prosiński and Szajowski [16] (see Section 3.1). In Section 3.2 we present results related to the best-choice duration problem (BCDP) with and without recall possibility.…”
Section: Duration Problems For the Full-information Casementioning
confidence: 99%
“…Note that the sign of the functions F and G does not depend on the parameter α. These sets are the same as in [16] (page 685). Using the same methodology we obtain the optimal strategy: it allows us to stop only in such a moment, when observed candidate is the largest so far and exceeds the value x .…”
Section: Discussionmentioning
confidence: 99%