Optimal dividend and capital injection under self-exciting claims
Paulin Aubert, Etienne Chevalier, Vathana Ly Vath
TL;DR
The paper tackles the problem of optimally distributing dividends and injecting capital in a surplus model where claim arrivals are self-exciting via a Hawkes process. It combines analytical results—establishing bounds, monotonicity, a capital-injection threshold, and a viscosity-solution characterization of the HJB variational inequality—with numerical PDE benchmarks and reinforcement-learning approaches (policy gradient and actor-critic) to learn near-optimal strategies. The key contributions include an explicit injection threshold $oldsymbol{ abla^ op}$, a demonstration that the value function is the unique viscosity solution, and a scalable RL framework that matches PDE benchmarks and remains stable across initial conditions. The practical impact lies in providing a tractable, data-driven method to navigate dividend and capital decisions under clustered claim dynamics, with potential extension to higher-dimensional settings.
Abstract
In this paper, we study an optimal dividend and capital-injection problem in a Cramér--Lundberg model where claim arrivals follow a Hawkes process, capturing clustering effects often observed in insurance portfolios. We establish key analytical properties of the value function and characterise the optimal capital-injection strategy through an explicit threshold. We also show that the value function is the unique viscosity solution of the associated HJB variational inequality. For numerical purposes, we first compute a benchmark solution via a monotone finite-difference scheme with Howard's policy iteration. We then develop a reinforcement learning approach based on policy-gradient and actor-critic methods. The learned strategies closely match the PDE benchmark and remain stable across initial conditions. The results highlight the relevance of policy-gradient techniques for dividend optimisation under self-exciting claim dynamics and point toward scalable methods for higher-dimensional extensions.
