Ruin Probabilities in the Compound Markov Binomial Model

Abstract

In this paper, we present a compound Markov binomial model which is an extension of the compound binomial model proposed by Gerber (1988a, b) and further examined by Shiu (1989) and Willmot (1993). The compound Markov binomial model is based on the Markov Bernoulli process which introduces dependency between claim occurrences. Recursive formulas are provided for the computation of the ruin probabilities over finite- and infinite-time horizons. A Lundberg exponential bound is derived for the ruin probability and numerical examples are also provided.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 60 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.