Article ID: | iaor1997944 |
Country: | United Kingdom |
Volume: | 28 |
Issue: | 3 |
Start Page Number: | 763 |
End Page Number: | 783 |
Publication Date: | Sep 1996 |
Journal: | Advances in Applied Probability |
Authors: | Chan Terence |
Keywords: | stochastic processes, cybernetics, programming: dynamic |
The ‘Mabinogion sheep’ problem, originally due to D. Williams, is a nice illustration in discrete time of the martingale optimality principle and the use of local time in stochastic control. The use of singular controls involving local time is even more strikingly highlighted in the context of continuous time. This paper considers a class of diffusion versions of the discrete-time Mabinogoin sheep problem. The stochastic version of the Bellman dynamic programming approach leads to a free boundary problem in each case. The most surprising feature in the continuous-time context is the existence of diffusion versions of the original discrete-time problem for which the optimal boundary is different from that in the discrete-time case; even when the optimal boundary is the same, the value functions can be very different.