We study the optimal insurance design problem. This is a risk sharing problem between an insured and an insurer. The main novelty in this paper is that we study this optimization problem under a risk-adjusted premium calculation principle for the insurance cover. This risk-adjusted premium...

The Munich chain-ladder method for claims reserving was introduced by Quarg and Mack on an axiomatic basis. We analyze these axioms, and we define a modified Munich chain-ladder method which is based on an explicit stochastic model. This stochastic model then allows us to consider claims...

The concept of best-estimate, prescribed by regulators to value insurance liabilities for accounting and solvency purposes, has recently been discussed extensively in the industry and related academic literature. To differentiate hedgeable and non-hedgeable risks in a general case, recent...

The aim of this paper is to understand and to model claims arrival and reporting delay in general insurance. We calibrate two real individual claims data sets to the statistical model of Jewell and Norberg. One data set considers property insurance and the other one casualty insurance. For our...

The discrete-time multifactor Vasiček model is a tractable Gaussian spot rate model. Typically, two- or three-factor versions allow one to capture the dependence structure between yields with different times to maturity in an appropriate way. In practice, re-calibration of the model to the...

We consider a one-period portfolio optimization problem under model uncertainty. For this purpose, we introduce a measure of model risk. We derive analytical results for this measure of model risk in the mean-variance problem assuming we have observations drawn from a normal variance mixture...

The study of random graphs has become very popular for real-life network modeling, such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice Zd, d ≥ 1, is a particular attractive example of a random graph model because it...

We define the nagging predictor, which, instead of using bootstrapping to produce a series of i.i.d. predictors, exploits the randomness of neural network calibrations to provide a more stable and accurate predictor than is available from a single neural network run. Convergence results for the...

The aim of this project is to analyze high-frequency GPS location data (second per second) of individual car drivers (and trips). We extract feature information about speeds, acceleration, deceleration, and changes of direction from this high-frequency GPS location data. Time series of this...

The aim of this project is to develop a stochastic simulation machine that generates individual claims histories of non-life insurance claims. This simulation machine is based on neural networks to incorporate individual claims feature information. We provide a fully calibrated stochastic...