Abstract
We discuss a solution of the optimal stopping problem for the case when a reward function is a power function of a process with independent stationary increments (random walks or Levy processes) on an infinite time interval. It is shown that an optimal stopping time is the first crossing time through a level defined as the largest root of the Appell function associated with the maximum of the underlying process.
Acknowledgements
The authors would like to thank two anonymous referees for their helpful comments and suggestions.
Notes
¶Supported by ARC Discovery grant.
§Supported by INTAS grant 03-51-50-18