On undiscounted non‐linear optimal multiple stopping

On undiscounted non‐linear optimal multiple stopping

0.00 Avg rating0 Votes
Article ID: iaor20125277
Volume: 14
Issue: 4
Start Page Number: 387
End Page Number: 416
Publication Date: Jun 2012
Journal: International Journal of Operational Research
Authors: ,
Keywords: programming: nonlinear, programming: markov decision
Abstract:

We study and formulate an undiscounted non‐linear optimal multiple stopping problem, with an application to the valuation of the perpetual American‐style discretely monitored Asian options. When the reward process is continuous, we follow a vector‐valued approach. Under the right‐continuity of this process, the problem can be reduced to a sequence of ordinary optimal stopping problems. In the Markovian case, we characterise the value function of the problem in terms of excessive functions. Finally, in case of a regular diffusion, we provide an optimal sequence of stopping times. The results are illustrated by some examples, where the value function of the problem is given explicitly.

Reviews

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