Robust utility maximization with intractable claims
We study a continuous-time expected utility maximization problem in which the investor at maturity receives the value of a contingent claim in addition to the investment payoff from the financial market. The investor knows nothing about the claim other than its probability distribution, hence an ``intractable claim''. In view of the lack of necessary information about the claim, we consider a robust formulation to maximize her utility in the worst scenario. We apply the quantile formulation to solve the problem, expressing the quantile function of the optimal terminal investment income as the solution of certain variational inequalities of ordinary differential equations and obtaining the resulting optimal trading strategy. In the case of an exponential utility, the problem reduces to a (non-robust) rank--dependent utility maximization with probability distortion whose solution is available in the literature. The results can also be used to determine the utility indifference price of the intractable claim.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Duality Theory for Exponential Utility--Based Hedging in the Almgren--Chriss Model
In this paper, we obtain a duality result for the exponential utility maximization problem where trading is subject to quadratic transaction costs and the investor is required to liquidate her position at the maturity da…
PositionOptimal Investment with Random Endowments and Transaction Costs: Duality Theory and Shadow Prices
This paper studies the utility maximization on the terminal wealth with random endowments and proportional transaction costs. To deal with unbounded random payoffs from some illiquid claims, we propose to work with the a…
From Axioms to Algorithms: Mechanized Proofs of the vNM Utility Theorem
This paper presents a comprehensive formalization of the von Neumann-Morgenstern (vNM) expected utility theorem using the Lean 4 interactive theorem prover. We implement the classical axioms of preference-completeness, t…
ManagementAPS: Active Pretraining with Successor Features
We introduce a new unsupervised pretraining objective for reinforcement learning. During the unsupervised reward-free pretraining phase, the agent maximizes mutual information between tasks and states induced by the poli…
Unsupervised Reinforcement LearningInstance Specific Approximations for Submodular Maximization
For many optimization problems in machine learning, finding an optimal solution is computationally intractable and we seek algorithms that perform well in practice. Since computational intractability often results from p…