×

Risk exchange. I: A unification of some existing results. (English) Zbl 0758.90014

Summary: The paper unifies certain concepts which have arisen within the field of risk exchange. Borch’s theorem on Pareto-optimal risk exchanges is shown to be derivable from a Bowley solution when there are only two participants in the risk exchange. This theorem is then extended to an \(n\)-party risk exchange by equating this to a sequence of 2-party exchanges between the \(n\) participants. Finally, the conditions for constrained Pareto-optimal risk exchanges are derived as extreme cases of Borch’s theorem. Thus Borch’s theorem and Bühlmann and Jewell’s theorem on constrained exchanges are shown to be ultimately derivable from the Bowley solution.
[For part II see the author, ibid., No. 1, 40-59 (1992; Zbl 0758.90015)].

MSC:

91B30 Risk theory, insurance (MSC2010)

Citations:

Zbl 0758.90015
Full Text: DOI

References:

[1] Borch K., Skandinavisk Aktuarietidskrift 43 pp 163– (1960)
[2] DOI: 10.2307/1909887 · Zbl 0119.36504 · doi:10.2307/1909887
[3] Bühlmann H., Mathematical methods in risk theory (1970) · Zbl 0209.23302
[4] Bühlmann H., Astin Bulletin 10 pp 243– (1979)
[5] DOI: 10.2143/AST.15.2.2015025 · doi:10.2143/AST.15.2.2015025
[6] DOI: 10.1016/0167-6687(85)90014-9 · Zbl 0579.62090 · doi:10.1016/0167-6687(85)90014-9
[7] Gerber H. U., Astin Bulletin 10 pp 25– (1978)
[8] DOI: 10.1017/S0305004100030991 · doi:10.1017/S0305004100030991
[9] DOI: 10.1017/S0305004100033399 · doi:10.1017/S0305004100033399
[10] DOI: 10.2143/AST.16.2.2015000 · doi:10.2143/AST.16.2.2015000
[11] DOI: 10.1137/0135005 · Zbl 0391.15011 · doi:10.1137/0135005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.