MULTIOBJECTIVE STOPPING PROBLEM FOR DISCRETE-TIME MARKOV PROCESSES: CONVEX ANALYTIC APPROACH

作者：Dufour F^*; Piunovskiy A B

来源：Journal of Applied Probability, 2010, 47(4): 947-966.

DOI：10.1239/jap/1294170511

• Optimal stopping
• constrained control
• Markov chain
• linear program
• convex analytic approach
• Markov decision process
• occupation measure

The purpose of this paper is to study an optimal stopping problem with constraints for a Markov chain with general state space by using the convex analytic approach. The costs are assumed to be nonnegative. Our model is not assumed to be transient or absorbing and the stopping time does not necessarily have a finite expectation. As a consequence, the occupation measure is not necessarily finite, which poses some difficulties in the analysis of the associated linear program. Under a very weak hypothesis, it is shown that the linear problem admits an optimal solution, guaranteeing the existence of an optimal stopping strategy for the optimal stopping problem with constraints.

• 出版日期2010-12
• 单位INRIA