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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: Date of creation: 05 Jul 2000 Date of revision: Handle: RePEc:sce:scecf0:233
Contact details of provider: Postal: CEF 2000, Departament d'Economia i Empresa, Universitat Pompeu Fabra, Ramon Trias Fargas, 25,27, 08005, Barcelona, Spain Fax: +34 93 542 17 46 Email: Web page: http://enginy.upf.es/SCE/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).
Related research
Keywords:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: