IDEAS home Printed from https://ideas.repec.org/a/cup/astinb/v5y1968i01p62-86_00.html
   My bibliography  Save this article

Driving with markov-programming

Author

Listed:
  • de Leve, G.
  • Weeda, P. J.

Abstract

Let us consider the following problem.A motorist has decided to effect an accident insurance under the following conditions. The insurance runs for one year. The premium for the first year amounts E0. If no damages have been claimed during i successive years, i = 1, 2 or 3 the premium is reduced to Ei. After four years of damagefree driving no further premium reduction is granted, so the premium remains E3. The premium is due on the first day of the year. The own risk amounts a0.The number of accidents of our motorist during a time period T is assumed to be Poisson distributed with parameter λT. The extent of the damage has distribution function F(s) with finite mean and variance.The problem of our motorist will be to decide whether to claim a damage or not. He will have to develop a strategy that specifies his decisions in every possible situation. His strategy will be called optimal if it minimizes the expected costs in the long run.We may expect that in view of the premium reduction, it will be unprofitable to claim damages which are not much larger than a0. Once a damage is claimed it will be profitable to claim all following damages that exceed a0 during the remaining part of the year.Hence his decisions will also depend on the time of the year and the premium paid at the beginning of that year. So we distinguish between four types of years, for each premium one.

Suggested Citation

  • de Leve, G. & Weeda, P. J., 1968. "Driving with markov-programming," ASTIN Bulletin, Cambridge University Press, vol. 5(1), pages 62-86, May.
  • Handle: RePEc:cup:astinb:v:5:y:1968:i:01:p:62-86_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S051503610000221X/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    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:cup:astinb:v:5:y:1968:i:01:p:62-86_00. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/asb .

    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.