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
1秒前
linfordlu完成签到,获得积分0
1秒前
Owen的应助被明理的青寒采纳,获得10
7秒前
8秒前
xldongcn完成签到 ,获得积分10
9秒前
XL完成签到,获得积分10
12秒前
12秒前
Nuguri完成签到,获得积分10
14秒前
Fin2046完成签到,获得积分10
14秒前
16秒前
DW的应助被科研通管家采纳,获得10
23秒前
24秒前
yu完成签到,获得积分10
24秒前
DW的应助被科研通管家采纳,获得10
24秒前
大模型的应助被科研通管家采纳,获得10
24秒前
DW的应助被科研通管家采纳,获得10
24秒前
DW的应助被科研通管家采纳,获得10
24秒前
DW的应助被科研通管家采纳,获得10
24秒前
DW的应助被科研通管家采纳,获得10
24秒前
181s的应助被科研通管家采纳,获得10
24秒前
DW的应助被科研通管家采纳,获得10
25秒前
DW的应助被科研通管家采纳,获得10
25秒前
修仙中的应助被科研通管家采纳,获得10
25秒前
海对面完成签到,获得积分10
25秒前
fuguier完成签到,获得积分10
25秒前
Enigma_GEB的应助被Lny采纳,获得10
26秒前
26秒前
chuchu完成签到 ,获得积分10
27秒前
28秒前
追寻的碧空完成签到,获得积分10
30秒前
高大绝义完成签到,获得积分10
33秒前
单纯向雪完成签到 ,获得积分10
33秒前
33秒前
西瓜霜完成签到 ,获得积分0
37秒前
巫马尔槐发布了新的文献求助10
38秒前
临河盗龙完成签到,获得积分10
39秒前
哎呀完成签到,获得积分20
41秒前
无语的断缘完成签到,获得积分10
42秒前
临河盗龙发布了新的文献求助10
42秒前
优雅的绿蓉完成签到 ,获得积分10
44秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Research Methodology: Best Practices for Rigorous, Credible, and Impactful Research 1000
自動車の空力技術 800
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7782858
求助须知:如何正确求助?哪些是违规求助? 9322213
关于积分的说明 20387818
捐赠科研通 7371464
什么是DOI,文献DOI怎么找? 3320460
关于科研通互助平台的介绍 2468506
邀请新用户注册赠送积分活动 2336600