A portfolio management problem is approximated through a Markov decision chain. The weak Euler scheme is applied to discretise the time evolution of a portfolio and an inverse distance method is used to describe the transition probabilities. The approximating Markov decision problem is solved by value iteration. Numerical solutions of varying degrees of accuracy to a few specific portfolio problems are obtained.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.