Upper and Lower Bounds of Optimal Stopping for a Random Sequence: The Case of Finite Horizon


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

This paper derives upper and lower bounds of the price in the optimal stopping problem for a an adapted random sequence in the case of finite horizon. As is demonstrated below, the bounds can be found by solving the maximax and maximin setups of optimal stopping problems. For these setups, we obtain conditions under which 1) a recurrent relation is satisfied for the upper (lower) truncated sequence of optimal stopping prices; 2) an optimality criterion is constructed for the stopping times; 3) the structure and invariance of the optimal stopping times are established. Some examples with explicit solutions of the maximax and maximin setups of optimal stopping problems are given.

About the authors

V. M. Khametov

National Research University Higher School of Economics; Moscow Aviation Institute (National Research University)

Author for correspondence.
Email: khametovvm@mail.ru
Russian Federation, Moscow; Moscow

E. A. Shelemekh

Central Economics and Mathematics Institute

Author for correspondence.
Email: letis@mail.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Pleiades Publishing, Inc.