Search arXivSearch

arXiv · 2406.00435

PSAHARA Utility Family: Modeling Non-monotone Risk Aversion and Convex Compensation in Incomplete Markets

Abstract

In hedge funds, convex compensation schemes are adopted to stimulate a high-profit performance for portfolio managers. In economics, non-monotone risk aversion is proposed to argue that individuals may not be risk-averse when the wealth level is low. Combining these two ingredients, we study the optimal control strategy of the manager in incomplete markets. Generally, we propose a wide family of utility functions, the piecewise symmetric asymptotic hyperbolic absolute risk aversion (PSAHARA) utility, to model the two ingredients, containing both non-concavity and non-differentiability as some abnormalities. Technically, we propose an additional assumption and prove concavification techniques of non--concave utility functions with a left unbounded domain in incomplete markets. Next, we derive an explicit optimal control for the family of PSAHARA utilities. This control is expressed into a unified four-term structure, featuring the asymptotic Merton term. Furthermore, we provide a detailed asymptotic analysis and numerical illustration of the optimal portfolio. We obtain several key insights, including that the convex compensation still induces a great risk-taking behavior in the case that the preference is modeled by SAHARA utility. Finally, we conduct a real-data analysis of the U.S. stock market under the above model and conclude that the PSAHARA portfolio is very risk-seeking and leads to a high return and a high volatility.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yang Liu, Zhenyu Shen. 2024-11-02. PSAHARA Utility Family: Modeling Non-monotone Risk Aversion and Convex Compensation in Incomplete Markets. https://arxiv.org/abs/2406.00435

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

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC