Explicit optimal value for Dynkin’s stopping game

Explicit optimal value for Dynkin’s stopping game

0.00 Avg rating0 Votes
Article ID: iaor19971044
Country: United Kingdom
Volume: 22
Issue: 10/12
Start Page Number: 313
End Page Number: 324
Publication Date: Nov 1995
Journal: Mathematical and Computer Modelling
Authors:
Keywords: programming: dynamic
Abstract:

Under the One-step Look Ahead rule of Dynamic Programming, an explicit game value of Dynkin’s stopping problem for a Markov chain is obtained by using a potential operator. The condition on the One-step rule could be extended to the k-step and infinity-step rule. The paper shall also decompose the game value as the sum of two explicit functions under these rules.

Reviews

Required fields are marked *. Your email address will not be published.