Deep Learning Methods for S Shaped Utility Maximisation with a Random Reference Point
We consider the portfolio optimisation problem where the terminal function is an S-shaped utility applied at the difference between the wealth and a random benchmark process. We develop several numerical methods for solving the problem using deep learning and duality methods. We use deep learning methods to solve the associated Hamilton-Jacobi-Bellman equation for both the primal and dual problems, and the adjoint equation arising from the stochastic maximum principle. We compare the solution of this non-concave problem to that of concavified utility, a random function depending on the benchmark, in both complete and incomplete markets. We give some numerical results for power and log utilities to show the accuracy of the suggested algorithms.
Code (1)
Tasks
Deep LearningSimilar Papers 제목 키워드 기반
S-shaped Utility Maximization with VaR Constraint and Partial Information
We study S-shaped utility maximisation with VaR constraint and unobservable drift coefficient. Using the Bayesian filter, the concavification principle, and the change of measure, we give a semi-closed integral represent…
A note on bequest preferences in utility maximisation for modern tontines
In this short note, we address two issues in the literature about modern tontines with bequest and utility maximisation: how to verify optimal controls and the decreasing allocation of funds in the tontine. We want to ra…
Common Sense ReasoningDuality Theory for Robust Utility Maximisation
In this paper we present a duality theory for the robust utility maximisation problem in continuous time for utility functions defined on the positive real axis. Our results are inspired by -- and can be seen as the robu…
Utility Maximisation for Exponential Levy Models with option and information processes
We consider expected utility maximisation problem for exponential Levy models and HARA utilities in presence of illiquid asset in portfolio. This illiquid asset is modelled by an option of European type on another risky …
Learning in Repeated Multi-Objective Stackelberg Games with Payoff Manipulation
We study payoff manipulation in repeated multi-objective Stackelberg games, where a leader may strategically influence a follower's deterministic best response, e.g., by offering a share of their own payoff. We assume th…