Papers
Topics
Authors
Recent
Search
2000 character limit reached

Duality for multidimensional ruin problem

Published 8 Dec 2014 in math.PR | (1412.2657v1)

Abstract: We consider a $d-$dimensional insurance network, with initial capital $a\in\Rd_+,$ operating under a risk diversifying treaty; this is described in terms of a regulated random walk ${Z{(a)}_n}$ via Skorokhod problem in $\Rd_+$ with reflection matrix $R;$ ${Y{(a)}_n}$ denotes the corresponding pushing process. Ruin (in a strong sense) of ${Z{(a)}_n}$ is defined as the marginal deficit of each company being positive (and hence zero surplus) at some time $n.$ A dual storage network is introduced through time reversal at sample path level over finite time horizon; the stochastic analogue is again a regulated random walk ${W_n}$ in $\Rd_+$ starting at $0.$ It is shown that ruin for ${Z{(a)}_n}$ corresponds to ${W_n}$ hitting open upper orthant determined by $R{-1}a$ before hitting the boundary of $\Rd_+,$ even at the sample path level. Under natural hypotheses, we show that $\P($ ruin of ${Z{(a)}_n}$ in finite time) $=\lim_{n\r\iy}\P(W_n\gg R{-1}a: n<$ boundary hitting time of storage process) $=\lim_{n\r\iy}\P(Y{(0)}_n \gg R{-1}a:\Delta Y{(0)}_n\gg 0).$ A notion of $d-$dimensional ladder height distribution is defined, and a Pollaczek-Khinchine formula derived; an expression for the ladder height distribution is presented. Our method is applicable to ruin problem for a continuous time $d-$dimensional Cramer-Lundberg type network, where the companies act independently in the absence of treaty.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.