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

Optimal asset allocation for DC pension subject to allocation and terminal wealth constraints under a remuneration scheme

Author

Listed:
  • Yinghui Dong
  • Mengyuan Shi
  • Chunrong Hua

Abstract

We investigate the optimal investment problem faced by a defined contribution (DC) pension fund manager under simultaneous allocation and expected shortfall (ES) constraints. Under a non concave utility, a Value-at-Risk (VaR) constraint does not lead to the full prevention of moral hazard. As a widely employed risk management tool, whether an ES constraint can provide a more effective protection than a VaR constraint has been a focus point of research. We apply a dual control approach and a concavification technique to solve the ES-constrained optimization problem for a DC pension plan under an incentive scheme and derive the closed-form representations of the optimal wealth and portfolio processes. Furthermore, we compare the effect of an ES constraint on the optimal investment behavior with that under a VaR constraint in the presence of an option-like scheme for the DC pension members. Theoretical and numerical results show that for a relatively low protection level, a joint VaR and an ES constraints induce the same structure of the optimal solution, which implies that for a non concave optimization problem, the ES-based risk management has lost its advantage over the VaR-based risk management. Therefore, it needs to design a more efficient risk measure to improve the risk management for a DC pension plan.

Suggested Citation

  • Yinghui Dong & Mengyuan Shi & Chunrong Hua, 2025. "Optimal asset allocation for DC pension subject to allocation and terminal wealth constraints under a remuneration scheme," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(3), pages 673-700, February.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:3:p:673-700
    DOI: 10.1080/03610926.2024.2316282
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2024.2316282?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:3:p:673-700. 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.