Budget-constrained optimal insurance with belief heterogeneity

被引:21
|
作者
Ghossoub, Mario [1 ]
机构
[1] Univ Waterloo, Dept Stat & Actuarial Sci, 200 Univ Ave W, Waterloo, ON N2L 3G1, Canada
来源
基金
加拿大自然科学与工程研究理事会;
关键词
Optimal insurance; Retention function; Deductible; Heterogeneous beliefs; Monotone likelihood ratio; Monotone hazard ratio; OPTIMAL REINSURANCE; RISK MEASURES; UTILITY;
D O I
10.1016/j.insmatheco.2019.09.002
中图分类号
F [经济];
学科分类号
02 ;
摘要
We re-examine the problem of budget-constrained demand for insurance indemnification when the insured and the insurer disagree about the likelihoods associated with the realizations of the insurable loss. For ease of comparison with the classical literature, we adopt the original setting of Arrow (1971), but allow for divergence in beliefs between the insurer and the insured; and in particular for singularity between these beliefs, that is, disagreement about zero-probability events. We do not impose the no sabotage condition on admissible indemnities. Instead, we impose a state-verification cost that the insurer can incur in order to verify the loss severity, which rules out ex post moral hazard issues that could otherwise arise from possible misreporting of the loss by the insured. Under a mild consistency requirement between these beliefs that is weaker than the Monotone Likelihood Ratio (MLR) condition, we characterize the optimal indemnity and show that it has a simple two-part structure: full insurance on an event to which the insurer assigns zero probability, and a variable deductible on the complement of this event, which depends on the state of the world through a likelihood ratio. The latter is obtained from a Lebesgue decomposition of the insured's belief with respect to the insurer's belief. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:79 / 91
页数:13
相关论文
共 50 条
  • [31] Statistical mechanics of budget-constrained auctions
    Altarelli, F.
    Braunstein, A.
    Realpe-Gomez, J.
    Zecchina, R.
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2009,
  • [32] Trade-offs and efficiencies in optimal budget-constrained multispecies corridor networks
    Dilkina, Bistra
    Houtman, Rachel
    Gomes, Carla P.
    Montgomery, Claire A.
    McKelvey, Kevin S.
    Kendall, Katherine
    Graves, Tabitha A.
    Bernstein, Richard
    Schwartz, Michael K.
    CONSERVATION BIOLOGY, 2017, 31 (01) : 192 - 202
  • [33] Algorithms for budget-constrained survivable topology design
    Garg, N
    Simha, R
    Xing, WX
    2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2002, : 2162 - 2166
  • [34] Budget-constrained rail network electrification problem
    Patil, Priyadarshan N.
    Walthall, Rydell
    Boyles, Stephen D.
    arXiv, 2021,
  • [35] BUDGET-CONSTRAINED PARETO-EFFICIENT ALLOCATIONS
    BALASKO, Y
    JOURNAL OF ECONOMIC THEORY, 1979, 21 (03) : 359 - 379
  • [36] Budget-Constrained Organization of Influential Social Events
    Han, Kai
    He, Yuntian
    Xiao, Xiaokui
    Tang, Shaojie
    Gui, Fei
    Xu, Chaoting
    Luo, Jun
    2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2018, : 917 - 928
  • [37] Budget-Constrained Reasoning in Agent Computational Environments
    Costantini, Stefania
    Formisano, Andrea
    AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, : 1311 - 1312
  • [38] Budget-Constrained Reinforcement of SCADA for Cascade Mitigation
    Farhadi, Vajiheh
    Vennelaganti, Sai Gopal
    He, Ting
    Chaudhuri, Nilanjan Ray
    La Porta, Thomas
    30TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN 2021), 2021,
  • [39] Budget-constrained sequential auctions with incomplete information
    Pitchik, Carolyn
    GAMES AND ECONOMIC BEHAVIOR, 2009, 66 (02) : 928 - 949
  • [40] Budget-Constrained Ego Network Extraction With Maximized Willingness
    Hsu, Bay-Yuan
    Lu, Chia-Hsun
    Chang, Ming-Yi
    Tseng, Chih-Ying
    Shen, Chih-Ya
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (12) : 7692 - 7707