Mathematics > Optimization and Control
[Submitted on 24 Jun 2022]
Title:Optimal dividends under a drawdown constraint and a curious square-root rule
View PDFAbstract: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.
Submission history
From: Hansjoerg Albrecher [view email][v1] Fri, 24 Jun 2022 11:38:15 UTC (838 KB)
Current browse context:
math.OC
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.