There is growing interest in the design of pension annuities that insure against idiosyncratic longevity risk while pooling and sharing systematic risk. This is partially motivated by the desire to reduce capital and reserve requirements while retaining the value of mortality credits; see for example Piggott, Valdez an…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “tontine schemes”
'Egalitarian pooling and sharing of longevity risk', a.k.a. 'The many ways to skin a tontine cat'q-fin.RM
The paper explores how to fairly share longevity risk among participants of tontine schemes.
problem Fair distribution of longevity risk among participants with varying wealth and health.
method Develops a modeling framework for sharing benefits among survivors in tontine schemes.
result There are multiple ways to share longevity risk, depending on social cohesion.
Optimal Retirement Tontines for the 21st Century: With Reference to Mortality Derivatives in 1693q-fin.PM
Historical tontines promised enormous rewards to the last survivors at the expense of those who died early. While this design appealed to the gambling instinct, it is a suboptimal way to manage longevity risk during retirement. This is why fair life annuities making constant payments -- where the insurance company is e…
A new tontine design aims to protect longevity risk with non-indexed investments.
problem Pooling longevity risk with traditional methods.
method Non-indexed investments with negatively correlated returns to mortality.
result Mathematical proof of recovery schedule using a Riccati equation.
We introduce a new pension product that offers retirees the opportunity for a lifelong income and a bequest for their estate. Based on a tontine mechanism, the product divides pension savings between a tontine account and a bequest account. The tontine account is given up to a tontine pool upon death while the bequest …
Tontines were once a popular type of mortality-linked investment pool. They promised enormous rewards to the last survivors at the expense of those died early. And, while this design appealed to the gambling instinc}, it is a suboptimal way to generate retirement income. Indeed, actuarially-fair life annuities making c…
The paper addresses optimal control in modern tontines with bequest preferences, showing a linear investment strategy.
problem Optimal controls and decreasing allocation in modern tontines with bequest preferences.
method Dual approach to solve optimal control problems with power utilities, modeling bequest preferences.
result Investment strategy almost linearly adjusts from 0% to 100% over time.
New tontine model with transaction costs for retirees.
problem Maximizing consumption and bequest utilities for retirees.
method Formulated as a stochastic and impulse control problem, characterized by viscosity solutions.
result V-shaped transaction region with two stages: smoothing and gambling.
Optimal tontine strategy maximizes withdrawals while minimizing shortfall.
problem Maximizing withdrawals from a tontine account with withdrawal constraints.
method Dynamic programming and Fourier methods to solve PIDE, tested with historical data.
result Tontine overlay strategy outperforms constant withdrawal strategies.
Paper finds closed-form solutions for tontine with bequest motive.
problem Finding optimal fractional consumption rate and bequest amount under bequest motive.
method Relaxing fixed proportions assumption, introducing bequest proportion as control function.
result Closed-form solutions for fractional consumption rate, wealth, bequest amount, and proportion.
Optimizes retirement income with MBGs and neural networks for longevity risk.
problem Maximizing lifetime withdrawals while managing longevity risk.
method Neural-network optimization under stochastic mortality.
result International diversification and longevity pooling improve retirement outcomes.
New probabilistic scheme combines deep learning with Runge-Kutta methods for solving PDEs.
problem Solving high-dimensional semi-linear parabolic PDEs efficiently.
method Probabilistic scheme using deep learning and Runge-Kutta methods.
result Crank-Nicolson schemes are efficient in terms of precision, computational cost, and numerical implementation.
It was proved in 1998 by Ben-David and Litman that a concept space has a sample compression scheme of size d if and only if every finite subspace has a sample compression scheme of size d. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same…
Study SL(2,C) character schemes for finitely generated groups.
problem Characterize SL(2,C) representations of finitely generated groups.
method Define coordinate rings and equations for SL(2,C) character schemes.
result Explicit equations for character schemes of finitely presented groups.
A new method for computing image curvature efficiently and accurately.
problem Low performance, low accuracy, and requirement of second order differentiability in conventional computation schemes.
method Proposes a novel discrete computation scheme for weighted Gaussian curvature.
result More accurate, computationally more efficient, and does not require second order differentiability.
Reduces multiclass and regression compression schemes to binary ones.
problem Developing efficient learning algorithms for multiclass and regression problems.
method Reduces sample compression schemes for binary classes to multiclass and regression settings.
result Establishes new compression schemes for multiclass and regression problems.
Study evaluates UK CDC schemes, finding intergenerational cross-subsidies in flat-accrual schemes and dynamic-accrual schemes can reduce but not eliminate them.
problem Intergenerational cross-subsidies in UK CDC schemes, particularly in flat-accrual schemes.
method Comparison of flat-accrual and dynamic-accrual CDC schemes, analysis of performance and level of cross-subsidies.
result Dynamic-accrual schemes can reduce but not eliminate intergenerational cross-subsidies, while flat-accrual schemes often have significant cross-subsidies.
We study first-order optimization methods obtained by discretizing ordinary differential equations (ODEs) corresponding to Nesterov's accelerated gradient methods (NAGs) and Polyak's heavy-ball method. We consider three discretization schemes: an explicit Euler scheme, an implicit Euler scheme, and a symplectic scheme.…
Generalizes soft noncommutative schemes to flag varieties.
problem Applying soft noncommutative schemes to flag varieties.
method Generalization via toric geometry and distinguished affine charts.
result Soft noncommutative schemes can be applied to flag varieties.
AES scheme improves Bermudan and American option pricing for Heston models.
problem Pricing Bermudan and American options under Heston models efficiently.
method AES scheme using non-central chi-square distribution for variance process.
result AES achieves higher accuracy and computational efficiency for Bermudan options.
In this paper we propose a new kind of high order numerical scheme for backward stochastic differential equations(BSDEs). Unlike the traditional -scheme, we reduce truncation errors by taking carefully for every subinterval according to the characteristics of integrands. We give error estimates of this nonlinear…
Defines hypercomplex analytic spaces and schemes.
problem No specific problem stated; focuses on definitions.
method Definitions and quotient construction.
result Canonical association of hypercomplex spaces to quotients.
New schemes for SDEs on manifolds keep solutions close to the manifold.
problem Solving SDEs constrained to manifolds in high accuracy.
method Geometrically invariant numerical schemes that remain close to the manifold.
result The schemes converge under standard assumptions and outperform existing methods.
We extend the scheme developed in B. Düring, A. Pitkin, "High-order compact finite difference scheme for option pricing in stochastic volatility jump models", 2019, to the so-called stochastic volatility with contemporaneous jumps (SVCJ) model, derived by Duffie, Pan and Singleton. The performance of the scheme is asse…
Characterizes Hilbert schemes and their geometric properties.
problem Understanding transverse Hilbert schemes and their geometric properties.
method Characterization through bi-Poisson structures and hyperkähler geometry.
result Characterization of transverse Hilbert schemes and description of their hyperkähler geometry.
Vector fields on schemes have flows if rings are finitely generated.
problem Understanding vector fields and flows on schemes.
method Analyzing vector fields on affine -schemes with finitely generated rings.
result Vector fields on affine -schemes with finitely generated rings have flows and are groupoid internal maps.
In this paper we propose a generalized numerical scheme for backward stochastic differential equations(BSDEs). The scheme is based on approximation of derivatives via Lagrange interpolation. By changing the distribution of sample points used for interpolation, one can get various numerical schemes with different stabil…
Extends JKO scheme for iterative algorithms with unknown parameters.
problem Computational and statistical analysis of iterative algorithms with unknown parameters.
method Develops statistical methods to estimate unknown parameters and adapts JKO scheme.
result Establishes asymptotic theory for the statistical JKO scheme.
A new scheme for FBSDEs simplifies computation without Monte Carlo.
problem Numerical solution for decoupled FBSDEs with reduced complexity.
method Recursive marginal quantization for fully quantization-based scheme.
result Effective numerical procedure for financial applications.
A discretization scheme for nonnegative diffusion processes is proposed and the convergence of the corresponding sequence of approximate processes is proved using the martingale problem framework. Motivations for this scheme come typically from finance, especially for path-dependent option pricing. The scheme is simple…
Study on statistical estimation over Gaussian MAC, comparing analog and digital schemes.
problem Distributed minimax statistical estimation over a Gaussian MAC.
method Developed analog joint estimation-communication schemes and derived information-theoretic lower bounds.
result Achieved risk within a logarithmic factor of information-theoretic lower bounds.
Efficient simulation scheme for rough Heston model reduces computational cost.
problem Accurate and efficient simulation of the rough Heston model for option pricing.
method Weak simulation scheme based on Markovian approximations of the rough Heston process.
result The new scheme exhibits second order weak convergence with linear computational cost.
Enhancing Efficiency of Pension Schemes through Effective Risk Governance: A Kenyan Perspectiveq-fin.RM
Study finds risk management significantly improves pension scheme efficiency in Kenya.
problem Improving efficiency of pension schemes in Kenya.
method Panel data analysis of 128 pension schemes from 2015-2021.
result Risk management significantly mediates the relationship between corporate governance and pension scheme efficiency.
In this paper, we propose an acceleration scheme for online memory-limited PCA methods. Our scheme converges to the first eigenvectors in a single data pass. We provide empirical convergence results of our scheme based on the spiked covariance model. Our scheme does not require any predefined parameters such as t…
In the present paper, we introduce a numerical scheme for the price of a barrier option when the price of the underlying follows a diffusion process. The numerical scheme is based on an extension of a static hedging formula of barrier options. For getting the static hedging formula, the underlying process needs to have…
The paper analyzes convergence of Riemannian SA schemes for stochastic optimization.
problem Stochastic optimization problems on Riemannian manifolds.
method Analyzes convergence of Riemannian stochastic approximation schemes using exponential map or retraction functions.
result Shows Riemannian SA schemes find an -stationary point within iterations.
New CDC scheme avoids intergenerational subsidies, offering better outcomes.
problem Intergenerational cross-subsidies in UK CDC schemes.
method Collective-Drawdown CDC approach using explicit insurance contracts.
result Better pension outcomes with no intergenerational cross-subsidies.
We introduce (binary) Darboux transformation for general differential equation of the second order in two independent variables. We present a discrete version of the transformation for a 6-point difference scheme. The scheme is appropriate to solving a hyperbolic type initial-boundary value problem. We discuss several …
We present a new high-order compact scheme for the multi-dimensional Black-Scholes model with application to European Put options on a basket of two underlying assets. The scheme is second-order accurate in time and fourth-order accurate in space. Numerical examples confirm that a standard second-order finite differenc…
We develop high-order approximations for the Heston model.
problem Modeling the Heston model with high accuracy and efficiency.
method Combining approximation schemes on different random grids to achieve any order of convergence.
result Achieve any order of convergence for the Heston model.
A risk of small defined-benefit pension schemes is that there are too few members to eliminate idiosyncratic mortality risk, that is there are too few members to effectively pool mortality risk. This means that when there are few members in the scheme, there is an increased risk of the liability value deviating signifi…
We study the performance of the adaptive construction scheme for a Bayesian inference on the Quadratic GARCH model which introduces the asymmetry in time series dynamics. In the adaptive construction scheme a proposal density in the Metropolis-Hastings algorithm is constructed adaptively by changing the parameters of t…
In this paper, we are interested in the strong convergence properties of the Ninomiya-Victoir scheme which is known to exhibit weak convergence with order 2. We prove strong convergence with order . This study is aimed at analysing the use of this scheme either at each level or only at the finest level of a multil…
We introduce a simulation scheme for Brownian semistationary processes, which is based on discretizing the stochastic integral representation of the process in the time domain. We assume that the kernel function of the process is regularly varying at zero. The novel feature of the scheme is to approximate the kernel fu…
Paper develops a finite dimensional approximation scheme for Riemannian manifolds.
problem Integration on Riemannian manifolds.
method New finite dimensional approximation scheme motivated by categorical colimit.
result Establishes a generalization for -functionals on Riemannian manifolds.
Suppose that one particular block in a stochastic block model is of interest, but block labels are only observed for a few of the vertices in the network. Utilizing a graph realized from the model and the observed block labels, the vertex nomination task is to order the vertices with unobserved block labels into a rank…
This paper studies parallelization schemes for stochastic Vector Quantization algorithms in order to obtain time speed-ups using distributed resources. We show that the most intuitive parallelization scheme does not lead to better performances than the sequential algorithm. Another distributed scheme is therefore intro…
Two new coding schemes improve the efficient communication of noisy data.
problem Efficient communication of noisy data in machine learning.
method Ordered Random Coding (ORC) and Hybrid Coding Scheme.
result Improved coding schemes over existing approaches.