Stackelberg reinsurance chain under model ambiguity

再保险 斯塔克伯格竞赛 模棱两可 差异(会计) 微分博弈 经济 订单(交换) 微观经济学 数理经济学 计算机科学 精算学 数学 财务 数学优化 会计 程序设计语言
作者
Jingyi Cao,Dongchen Li,Virginia R. Young,Bin Zou
出处
期刊:Scandinavian Actuarial Journal [Taylor & Francis]
卷期号:2024 (4): 329-360 被引量:3
标识
DOI:10.1080/03461238.2023.2255399
摘要

AbstractIn this paper, we consider a continuous-time version of a reinsurance chain, which is sequentially formed by n+1 companies, with the first company being the primary insurer and the rest being reinsurers. Because of possible model misspecification, all companies are ambiguous about the original risk of the primary insurer. We model each reinsurance contracting problem as a Stackelberg game, in which the assuming reinsurer acts as the leader while the ceding company is the follower. Reinsurance is priced using the mean-variance premium principle and all companies are risk neutral under their own beliefs. We obtain equilibrium indemnities, premium loadings, and distortions in closed form, all of which are proportional to the original risk, with the corresponding proportions decreasing along the chain. We also show that the reinsurance chain with ambiguity aversions in increasing order is optimal from the perspectives of both selfish individual companies and an unselfish central planner.Keywords: Knightian uncertaintyambiguitymean-variance premium principleStackelberg differential gamereinsuranceJEL Subject Classifications: C61C72C73D81G22 AcknowledgmentsWe are grateful to the anonymous reviewers for their insightful comments.Disclosure statementNo potential conflict of interest was reported by the author(s).Notes1 See https://content.naic.org/cipr-topics/reinsurance.2 Note that Stackelberg equilibria are reached in two steps: the follower optimizes first given an arbitrary but fixed strategy from the leader, and next the leader optimizes upon knowing the follower's optimal decisions. However, in a standard Cournot game, all players make their decisions simultaneously.3 For the line of research on reinsurance tree, see Asimit et al. (Citation2013), Chi & Meng (Citation2014), Boonen et al. (Citation2016), and Boonen & Ghossoub (Citation2019). Cao et al. (Citation2023b) compare both the reinsurance tree and chain in a market with two reinsurers.4 Chen et al. (Citation2020) argue that static models 'cannot reflect the changes in the claim processes' and, thus, 'may not be sufficient for the managerial needs in the context of dynamic insurance risk management in the long run' (see pp. 129-130 therein).5 For a single, continuous-time Stackelberg reinsurance game with one insurer and one reinsurer, please see Chen & Shen (Citation2018, Citation2019) and Li & Young (Citation2022).6 It is well documented in the literature that neither the insurer nor the reinsurer knows the precise distribution of the underlying loss in a reinsurance contract. This naturally motivates the incorporation of model ambiguity, also termed model uncertainty, in the study of reinsurance. For related literature, see, for instance, Zhang & Siu (Citation2009), Hu et al. (Citation2018), Gu et al. (Citation2020), and Cao et al. (Citation2022, Citation2023a).7 This assumption is well-justified in the literature of insurance economics; see Rothschild & Stiglitz (Citation1976).8 This result lends support to Gerber (Citation1984), who only considers proportional reinsurance, because we do not impose any assumption on the form of reinsurance.9 If j=0, then i=0,1,…,j−1 represents the empty set.10 We fix the position of company 0, the primary insurer, in the reinsurance chain. It is straightforward, with only notational changes, to allow company 0 to switch places with company 1.11 In our model, the only distinguishing characteristic of a reinsurer is its ambiguity parameter. Thus, without loss of generality, assume that the ambiguity parameters of the n reinsurers are n distinct positive numbers.12 According to Insurance Information Institute, 'The London Market is a distinct, separate part of the U.K. insurance and reinsurance industry centered in the City of London. Its main participants are insurance and reinsurance companies, Lloyd's of London syndicates, Marine Protection and Indemnity Clubs (P&I Clubs), and brokers who handle most of the business'.Additional informationFundingJingyi Cao and Dongchen Li acknowledge the financial support from the Natural Sciences and Engineering Research Council of Canada (grant numbers 05061 and 04958, respectively). V. R. Young thanks the Cecil J. and Ethel M. Nesbitt Professorship for financial support of her research.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
王木木完成签到,获得积分10
刚刚
里里完成签到,获得积分10
刚刚
@@发布了新的文献求助10
刚刚
安静的缘分完成签到,获得积分10
1秒前
Yrawn完成签到 ,获得积分10
1秒前
隐形曼青应助maomao采纳,获得10
1秒前
牛太虚完成签到,获得积分10
1秒前
吃个大笼包完成签到,获得积分10
1秒前
愉快小小完成签到 ,获得积分10
2秒前
英姑应助Netsky采纳,获得10
2秒前
2秒前
lcy发布了新的文献求助10
2秒前
2秒前
2秒前
stricer发布了新的文献求助30
2秒前
2秒前
无聊的行者完成签到,获得积分10
3秒前
3秒前
脑洞疼应助传统的博涛采纳,获得10
3秒前
海的呼唤完成签到,获得积分10
4秒前
莫我肯顾完成签到,获得积分10
4秒前
5秒前
12389发布了新的文献求助10
5秒前
NMR完成签到,获得积分10
5秒前
阿浩完成签到,获得积分10
5秒前
fxx关闭了fxx文献求助
5秒前
海石酸辣发布了新的文献求助10
5秒前
老实的半莲完成签到,获得积分10
5秒前
6秒前
文龙完成签到,获得积分10
6秒前
RRR完成签到,获得积分20
6秒前
青梧完成签到,获得积分10
6秒前
@@完成签到,获得积分10
6秒前
6秒前
7秒前
不喜欢孜然完成签到,获得积分10
7秒前
7秒前
yayaya发布了新的文献求助10
8秒前
zh完成签到,获得积分10
8秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Arthritis and Related Conditions, An Issue of Orthopedic Clinics 1000
Development of a Bridge Weigh-In-Motion System: A technology to convert the bridge response to the passage of traffic into data on vehicle configurations, speeds, times of travel and weights 1000
ズームレンズの光学設計に関する研究 800
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 700
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7291510
求助须知:如何正确求助?哪些是违规求助? 8910474
关于积分的说明 18861054
捐赠科研通 6958835
什么是DOI,文献DOI怎么找? 3209339
关于科研通互助平台的介绍 2378998
邀请新用户注册赠送积分活动 2185193