June 2022 A dynamic programming approach to distribution-constrained optimal stopping
Sigrid Källblad
Author Affiliations +
Ann. Appl. Probab. 32(3): 1902-1928 (June 2022). DOI: 10.1214/21-AAP1724

Abstract

We consider an optimal stopping problem where a constraint is placed on the distribution of the stopping time. Reformulating the problem in terms of so-called measure-valued martingales enables us to transform the distributional constraint into an initial condition and view the problem as a stochastic control problem; we establish the corresponding dynamic programming principle. The method offers a systematic approach for solving the problem for general constraints and under weak assumptions on the cost function. In addition, we provide certain continuity results for the value of the problem viewed as a function of its distributional constraint.

Funding Statement

The author gratefully acknowledges financial support from the Swedish Research Council (Grant 2020-03449).

Citation

Download Citation

Sigrid Källblad. "A dynamic programming approach to distribution-constrained optimal stopping." Ann. Appl. Probab. 32 (3) 1902 - 1928, June 2022. https://doi.org/10.1214/21-AAP1724

Information

Received: 1 September 2019; Revised: 1 April 2021; Published: June 2022
First available in Project Euclid: 29 May 2022

MathSciNet: MR4430004
zbMATH: 1503.60050
Digital Object Identifier: 10.1214/21-AAP1724

Subjects:
Primary: 49L20 , 60G40 , 60G57 , 62L15
Secondary: 06A06 , 28B20 , 49Q20 , 58E25 , 60J25 , 91A15 , 93E20

Keywords: Distribution-constrained optimal stopping , dynamic programming principle , measurable selection , measure-valued martingales , Optimal transport

Rights: Copyright © 2022 Institute of Mathematical Statistics

JOURNAL ARTICLE
27 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.32 • No. 3 • June 2022
Back to Top