SearcharxivSearch

arXiv · 2206.12220

Optimal dividends under a drawdown constraint and a curious square-root rule

Abstract

In this paper we address the problem of optimal dividend payout strategies from a surplus process governed by Brownian motion with drift under a drawdown constraint, i.e. the dividend rate can never decrease below a given fraction $a$ of its historical maximum. We solve the resulting two-dimensional optimal control problem and identify the value function as the unique viscosity solution of the corresponding Hamilton-Jacobi-Bellman equation. We then derive sufficient conditions under which a two-curve strategy is optimal, and show how to determine its concrete form using calculus of variations. We establish a smooth-pasting principle and show how it can be used to prove the optimality of two-curve strategies for sufficiently large initial and maximum dividend rate. We also give a number of numerical illustrations in which the optimality of the two-curve strategy can be established for instances with smaller values of the maximum dividend rate, and the concrete form of the curves can be determined. One observes that the resulting drawdown strategies nicely interpolate between the solution for the classical unconstrained dividend problem and the one for a ratcheting constraint as recently studied in Albrecher et al. (2022). When the maximum allowed dividend rate tends to infinity, we show a surprisingly simple and somewhat intriguing limit result in terms of the parameter $a$ for the surplus level on from which, for sufficiently large current dividend rate, a take-the-money-and-run strategy is optimal in the presence of the drawdown constraint.

Explore related subjects

Keep this discovery

BibTeXRIS

Hansjoerg Albrecher, Pablo Azcue, Nora Muler. 2022-06-24. Optimal dividends under a drawdown constraint and a curious square-root rule. https://arxiv.org/abs/2206.12220

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC