Approximative solutions of optimal stopping and selection problems
Mathematica Applicanda, Tome 44 (2016) no. 1, pp. 17-44
Cet article a éte moissonné depuis la source Annales Societatis Mathematicae Polonae Series
In this paper we review a series of developments over the last 15 years in which a general method for the approximative solution of finite discrete time optimal stopping and choice problems has been developed. This method also allows to deal with multiple stopping and choice problems and to deal with stopping or choice problems for some classes of dependent sequences.The basic assumption of this approach is that the sequence of normalized observations when embedded in the plane converges in distribution to a Poisson or to a cluster process. For various classes of examples the method leads to explicit or numerically accessible solutions.
Classification :
60G40, 62L15
Mots-clés : best choice problem, optimal stopping, Poisson process
Mots-clés : best choice problem, optimal stopping, Poisson process
@article{10_14708_ma_v44i1_826,
author = {Ludger R\"uschendorf},
title = {Approximative solutions of optimal stopping and selection problems},
journal = {Mathematica Applicanda},
pages = { 17--44},
year = {2016},
volume = {44},
number = {1},
doi = {10.14708/ma.v44i1.826},
language = {pl},
url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v44i1.826/}
}
TY - JOUR AU - Ludger Rüschendorf TI - Approximative solutions of optimal stopping and selection problems JO - Mathematica Applicanda PY - 2016 SP - 17 EP - 44 VL - 44 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.14708/ma.v44i1.826/ DO - 10.14708/ma.v44i1.826 LA - pl ID - 10_14708_ma_v44i1_826 ER -
Ludger Rüschendorf. Approximative solutions of optimal stopping and selection problems. Mathematica Applicanda, Tome 44 (2016) no. 1, pp. 17-44. doi: 10.14708/ma.v44i1.826
Cité par Sources :