|
Upravlenie Bol'shimi Sistemami, 2014, Issue 52, Pages 6–22
(Mi ubs784)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Control Theory
Algorithm to solve the optimal stopping problem with finite horizon
V. M. Khametova, E. A. Shelemekhb, E. Yasonova a HSE
b CEMI RAS
Abstract:
We propose an algorithm that solves the optimal stopping problem with the finite horizon. The algorithm is based on a derived recurrent equation for the optimal stopping time. It fulfils "separation" principle of solving the optimal stopping problem. This algorithm, implemented in Maple 14 system of computer algebras, is used to solve optimal stopping problems for several discrete Markovian sequences.
Keywords:
optimal stopping problem, Snell’s envelope, stopping region.
Citation:
V. M. Khametov, E. A. Shelemekh, E. Yasonov, “Algorithm to solve the optimal stopping problem with finite horizon”, UBS, 52 (2014), 6–22
Linking options:
https://www.mathnet.ru/eng/ubs784 https://www.mathnet.ru/eng/ubs/v52/p6
|
Statistics & downloads: |
Abstract page: | 352 | Full-text PDF : | 143 | References: | 54 |
|