Advanced Search
MyIDEAS: Login

Reinventing the Risk Sharing Mechanism of Defined Benefit Pension Plans

Contents:

Author Info

  • Shimizu, Nobuhiro
Registered author(s):

    Abstract

    In this paper, I will introduce several new mechanisms of risk sharing regarding occupational retirement provisions, based on the analysis of present risk sharing between sponsoring employers and plan participants, individual participants and participants as a group, active members and beneficiaries (including deferred members), etc. Among others, I will introduce "Ring-fenced" DB (RfDB) plans, which introduce "share" structure into contributions and reserves, prohibit "lending" from active members to beneficiaries when the plan is in an underfunded status (actuarial deficiency), and allow temporary benefit reductions within prescribed ranges according to the funding level. The risk active members bear will be eased in RfDB plans, and market interest risk sponsoring employers bear will also be eased, because some portion of benefits becomes conditional. RfDB plans allow investments with greater risk tolerance, which may benefit both labor and management from a long-term perspective. It will also be possible to ease funding rules substantially for RfDB plans. It is said that DB plans are on the verge of extinction mainly by the threats from accounting standards. Taking this into account, it is necessary to expand the variation of risk sharing mechanisms in occupational retirement provisions.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://hermes-ir.lib.hit-u.ac.jp/rs/bitstream/10086/14133/1/pie_dp304.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Center for Intergenerational Studies, Institute of Economic Research, Hitotsubashi University in its series Discussion Paper with number 304.

    as in new window
    Length: 37 p.
    Date of creation: Jan 2007
    Date of revision:
    Handle: RePEc:hit:piedp2:304

    Contact details of provider:
    Postal: 2-1 Naka, Kunitachi City, Tokyo 186-8603
    Phone: +81-42-580-8336
    Fax: +81-42-580-8333
    Email:
    Web page: http://cis.ier.hit-u.ac.jp/
    More information through EDIRC

    Related research

    Keywords: "Ring-fenced" DB plan; "Retrospective" DB plan; Sequential plan; Combination plan; Collective DC plan; DC conversion;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:hit:piedp2:304. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Digital Resources Section, Hitotsubashi University Library).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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