Skip to main navigation Skip to search Skip to main content

A dynamic stochastic network model for asset allocation problem

  • Haiqing Song
  • , Huei-Chuen Huang
  • , Ning Shi*
  • , Kin Keung K. K. Lai
  • *Corresponding author for this work

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    Abstract

    Asset allocation is an important decision problem in financial planning. In this paper, we study the multistage dynamic asset allocation problem in which an investor is allowed to reallocate its wealth among a set of assets over finite discrete decision points and the stochastic return rates of the assets follow aMarkov chain with nonstationary transition probabilities. The objective is to maximize the utility of the wealth at the end of the planning horizon where the utility of the wealth follows a general piecewise linear and concave function. Transaction costs are considered. We formulate the problem with a dynamic stochastic network model which has potential to introduce a computationally tractable tool to deal with the dynamic asset allocation problem of large number of assets and long planning horizon. © 2009 IEEE.
    Original languageEnglish
    Title of host publicationProceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009
    Pages597-601
    Volume2
    DOIs
    Publication statusPublished - 2009
    Event2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009 - Sanya, Hainan, China
    Duration: 24 Apr 200926 Apr 2009

    Publication series

    Name
    Volume2

    Conference

    Conference2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009
    PlaceChina
    CitySanya, Hainan
    Period24/04/0926/04/09

    Fingerprint

    Dive into the research topics of 'A dynamic stochastic network model for asset allocation problem'. Together they form a unique fingerprint.

    Cite this