IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2025i6p1702-1728.html
   My bibliography  Save this article

Equilibrium multi-period investment strategy for a DC pension plan with incomplete information: Hidden Markov model

Author

Listed:
  • Lihua Bian
  • Ling Zhang

Abstract

In the financial market with both observable and unobservable market states, this article explores the equilibrium investment strategy for a DC pension plan with the mean-variance criterion in a discrete-time setting. The dynamics of the partially observed market state are described by a discrete-time finite-state hidden Markov chain. There is a riskless asset and a risky asset in the financial market, where the return rate of the risky asset depends both on the observable and unobservable market states. Meanwhile, the stochastic salary process is also modulated by the observable and unobservable market states. Under the framework of non cooperative game, we first define the equilibrium investment strategy for the multi-period mean-variance DC pension plan. By adopting the sufficient statistics method, the investment problem for the mean-variance DC pension plan with incomplete information is transformed into the one with complete information. The closed-form equilibrium investment strategy is derived by solving the extended Bellman equation. Finally, numerical results show that the incomplete information has significant impacts on the equilibrium investment strategy and the equilibrium efficient frontier. Neglecting the reality of incomplete information in the financial market will reduce the investment benefit of the DC pension plan. The longer the investment horizon, the greater the investment benefit loss for the DC pension plan.

Suggested Citation

  • Lihua Bian & Ling Zhang, 2025. "Equilibrium multi-period investment strategy for a DC pension plan with incomplete information: Hidden Markov model," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(6), pages 1702-1728, March.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:6:p:1702-1728
    DOI: 10.1080/03610926.2024.2349688
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2349688
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2024.2349688?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:54:y:2025:i:6:p:1702-1728. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.