
doi: 10.1007/bf01441962
The paper treats a computational method for the Optimal Stopping and Stochastic Impulsive Control problem for a diffusion. In the latter problem control acts only intermittently since there is a basic positive “transaction” cost to be paid at each instant that the control acts. For eachh > 0, a controlled Markov chain is constructed, whose continuous time interpolations are a natural approximation to the diffusion, for both the optimal stopping and impulsive control situations. The solutions to the optimal stopping and impulsive control problems for the chains are relatively easy to obtain by using standard procedures, and they converge to the solutions of the corresponding problems for the diffusion models ash→0.
Stopping times; optimal stopping problems; gambling theory, Existence theories for optimal control problems involving partial differential equations, Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems
Stopping times; optimal stopping problems; gambling theory, Existence theories for optimal control problems involving partial differential equations, Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
