Characterization of Fully Coupled FBSDE in Terms of Portfolio Optimization
Samuel Drapeau, Peng Luo, Dewen Xiong

TL;DR
This paper characterizes fully coupled FBSDEs through BSDE sub-solutions, applying it to utility optimization under uncertainty, and provides explicit examples for pricing and recursive utilities.
Contribution
It offers a new verification and characterization framework for coupled FBSDEs and demonstrates their application in utility and pricing problems.
Findings
Explicit methods to quantify costs of market incompleteness
Procedures to find optimal solutions for recursive utilities
Application of FBSDE characterization to utility optimization
Abstract
We provide a verification and characterization result of optimal maximal sub-solutions of BSDEs in terms of fully coupled forward backward stochastic differential equations. We illustrate the application thereof in utility optimization with random endowment under probability and discounting uncertainty. We show with explicit examples how to quantify the costs of incompleteness when using utility indifference pricing, as well as a way to find optimal solutions for recursive utilities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\KOMAoptions
DIV=last
[1][email protected] \eMail[2][email protected] \eMail[3][email protected]
\myThanks
[t1]Financial support from the National Science Foundation of China, Grant number 11971310. \myThanks[t2]Financial support from the National Science Foundation of China, Grant number 11671257. \myThanks[t3]Financial support from Shanghai Jiao Tong University, Grant “Assessment of Risk and Uncertainty in Finance” number AF0710020. \myThanks[t4]Financial support from the Natural Sciences and Engineering Research Council of Canada, Grant RGPIN-2017-04054.
Characterization of Fully Coupled FBSDE in Terms of Portfolio Optimization
Samuel Drapeau
Peng Luo
Dewen Xiong
SAIF/CAFR/CMAR and School of Mathematical Sciences, Shanghai Jiao Tong University, China
Department of Statistics and Actuarial Sciences, University of Waterloo, Canada
School of Mathematical Sciences, Shanghai Jiao Tong University, China
(March 8, 2024)
Abstract
We provide a verification and characterization result of optimal maximal sub-solutions of BSDEs in terms of fully coupled forward backward stochastic differential equations. We illustrate the application thereof in utility optimization with random endowment under probability and discounting uncertainty. We show with explicit examples how to quantify the costs of incompleteness when using utility indifference pricing, as well as a way to find optimal solutions for recursive utilities.
\keyWords
Fully Coupled FBSDE, Utility Portfolio Optimization, Random Endowment, Probability and Discounting Uncertainty.
\keyAMSClassification
60H20 - 93E20 - 91B16 - 91G10
1 Introduction
Our motivation is the study of the classical portfolio optimization as follows: In a Brownian filtrated probability space, we consider an agent having a random endowment – or contingent claim – delivering at time . Starting with an initial wealth , she additionally has the opportunity to invest with a strategy in a financial market with stocks resulting in a corresponding wealth process
[TABLE]
where . She intends to choose a strategy as to optimize her utility in the sense that
[TABLE]
Hereby, is a general utility function – quasi-concave and increasing – mapping random variables to .111On the one hand, quasi-concavity reflects the underlying convexity of general preference ordering in terms of diversification, and on the other hand, monotonicity is a consequence of preferences for better outcomes, see [3, 7] for instance. For instance where is an increasing concave function corresponding to the certainty equivalent of the classical expected utility à la von Neumann and Morgenstern [40] and Savage [37]. It may however be a more general concave and increasing operator given by non-linear expectations – solutions of concave backward stochastic differential equations – introduced by Peng [31]. In this setting the utility is given by the value , solution at time [math] of the concave backward stochastic differential equation
[TABLE]
for a jointly convex Lipschitz generator and is a -dimensional Brownian motion. This functional is concave and increasing. Recently, Drapeau et al. [9] introduced the concept of minimal super-solution of convex backward stochastic differential equations – in this paper maximal sub-solutions of concave backward stochastic differential equations – to extend the existence domain of classical backward stochastic differential equations for generator having arbitrary growth. In this context, the utility is given by the value , maximal sub-solution of the concave backward stochastic differential equation
[TABLE]
This functional is also concave and increasing and therefore a utility functional. Furthermore, according to Drapeau et al. [10], it admits a dual representation
[TABLE]
where is the convex conjugate of the generator , is a discounting factor and is a probability density. The interpretation of this utility functional is that it assesses probability uncertainty, as for monetary risk measures see [16], as well as discounting uncertainty, as for sub-cash additive functional see [12].
Assuming and taking the utility defined as the value at [math] of the maximal sub-solution of (1), we want to find a strategy maximizing . Given the corresponding maximal sub-solution of (1) such that , proceeding to the variable change
[TABLE]
where222For , we will use the notation where and denote the first and the last components of and make the convention that if . leads to the following equivalent formulation in terms of the following forward backward stochastic system
[TABLE]
for some bounded market price of risk . Transferring the terminal dependence on the forward part to the generator allows to state the main results of this paper, namely, a verification and characterization of an optimal strategy in terms of the following fully coupled forward backward stochastic differential equation
[TABLE]
where
- •
is a dimensional Brownian motion whereby and denote the first and last components, respectively;
- •
is a convex generator;
- •
is a bounded terminal condition.
- •
is a point-wise solution to
[TABLE]
and the optimal strategy is given by .
As for maximal sub-solutions of backward stochastic differential equations introduced and studied by Drapeau et al. [9], Heyne et al. [19], they can be understood as an extension of backward stochastic differential equations, where equality is dropped in favor of inequality allowing weaker conditions for the generator . It allows to achieve existence, uniqueness and comparison theorem without growth assumptions on the generator as well as weaker integrability condition on the forward process and terminal condition. To stress the relation between maximal sub-solutions and solutions of backward stochastic differential equations, maximal sub-solutions can be characterized as maximal viscosity sub-solutions in the Markovian case, see [8]. It also turns out that they are particularly adequate for optimization problem in terms of convexity or duality among others, see [10, 20] and apply to larger class of generators than backward stochastic differential equations does.
Literature Discussion
Utility optimization problems in continuous time are popular topics in finance. Karatzas et al. [24] considered the optimization of the expected discounted utility of both consumption and terminal wealth in the complete market where they obtained an optimal consumption and wealth processes explicitly. Using duality methods, Cvitanić et al. [6] characterized the problem of utility maximization from terminal wealth of an agent with a random endowment process in semi-martingale model for incomplete markets. Backward stochastic differential equations, introduced in the seminal paper by Pardoux and Peng [30] in the Lipschitz case and Kobylanski [26] for the quadratic one, have revealed to be central in stating and solving problems in finance, see El Karoui et al. [13]. Duffie and Epstein [11] defined the concept of recursive utility by means of backward stochastic differential equations, generalized in Chen and Epstein [4] and Quenez and Lazrak [33]. Utility optimization characterization in that context has been treated in El Karoui et al. [14] in terms of a forward backward system of stochastic differential equations. Using a martingale argumentation, Hu et al. [23] characterized utility maximization by means of quadratic backward stochastic differential equations for small traders in incomplete financial markets with closed constraints. Following this line with a general utility function, Horst et al. [22] characterized the optimal strategy via a fully-coupled forward backward stochastic differential equation. With a similar characterization, Santacroce and Trivellato [36] considered the problem with a terminal random liability when the underlying asset price process is a continuous semi-martingale. Bordigoni et al. [1] studied a stochastic control problem arising in utility maximization under probability model uncertainty given by the relative entropy, see also Schied [39], Matoussi et al. [29]. Backward stochastic differential equations, can be viewed themselves as generalized utility operators – so called -expectations introduced by Peng [31] – which are related to risk measures, Gianin [17], Peng [32], Gianin [18]. As in the classical case, maximal sub-solutions of concave backward stochastic differential equations are nonlinear expectations as well. In this respect, Heyne et al. [21] consider utility optimization in that framework, providing existence of optimal strategy using duality methods as well as existence of gradients. However they do not provide a characterization of the optimal solution to which this work is dedicated to.
Discussion of the results and outline of the paper
The existence and uniqueness of maximal sub-solutions in [9, 19, 8] depends foremost on the integrability of the terminal condition , admissibility conditions on the local martingale part, and the properties of the generator – positive, lower semi-continuous, convex in and monotone in or jointly convex in . In the present context though, the generator can no longer be positive, even uniformly linearly bounded from below. Therefore we had to adapt the admissibility conditions, adequate for the optimization problem we are looking at. Henceforth, we provide existence and uniqueness of maximal sub-solutions under these new admissibility conditions in Section 2. We further present there the formulation of the utility maximization problem and the transformation leading the forward backward system (2). With this result at hand, we can address in Section 3 the characterization in terms of optimization of maximal sub-solutions of the forward backward stochastic differential equation. Our first main result, Theorem 3.1, provides a verification argument for solutions of coupled forward backward stochastic differential equation in terms of optimal strategy. The resulting system excerpt an auxiliary backward stochastic differential equation specifying the gradient dynamic. The second main result, Theorem 3.8, provides a characterization of optimal strategies in terms of solution of a coupled forward backward stochastic differential equation. It turns out, that an auxiliary backward stochastic differential equation is necessary in order to specify the gradient of the solution. These result extends the ones from Horst et al. [22] stated for utility maximization à la Savage [37]. We illustrate the results in Section 4 by considering utility optimization in a financial context with explicit solutions in given examples. These explicit solutions allow to address for instance the cost of incompleteness in a financial market. Finally, we address how the result can be applied when considering optimization for recursive utilities à la Kreps and Porteus [28] or for the present case in continuous time à la Duffie and Epstein [11]. The proof of existence and uniqueness of maximal sub-solutions being using the same techniques as [9] is postponed in Appendix A.
1.1 Notations
Let be a fixed time horizon and be a filtered probability space, where the filtration is generated by a -dimensional Brownian motion and fulfills the usual conditions. We further assume that . Throughout, we split this dimensional Brownian motion into two parts with and where . We denote by the set of -measurable random variables identified in the -almost sure sense. Every inequality between random variables is to be understood in the almost sure sense. Furthermore as in the introduction, to keep the notational burden as minimal as possible, we do not write the index in and for the integrands unless necessary. We furthermore generically use the short writing for the process . We say that a càdlàg process is integrable if is integrable for every . We use the notations
- •
, and for and in .
- •
and .
- •
for and in , let and if is in .
- •
for , and
[TABLE]
- •
and are the set of measurable and -integrable random variables identified in the -almost sure sense, .
- •
the set of càdlàg adapted processes.
- •
the set of -valued predictable processes such that is a local martingale.333That is -almost surely.
- •
the set of local martingales for .
- •
the set of those in such that , .
- •
the set of martingales for .
- •
the set of those in such that is a bounded mean oscillations martingale. That is, where runs over all stopping times. Note that according to the [25], the norms are all equivalent for where where runs over all stopping times. In particular .
- •
the set of those such that is in .
- •
the set of those uniformly bounded .
- •
the stochastic exponential of , that is .
- •
the stochastic discounting of , that is .
- •
.
- •
For in we denote by the equivalent measure to with density
[TABLE]
under which is a Brownian motion.
- •
We generically use the notation for the decomposition of vectors in into their first components and last ones. We use the same conventions for the space where . Also the same for , , and .
In the case where everything in the following with a disappears or equivalently is set to [math] and everything with a becomes without .
For a convex function , we denote its convex conjugate
[TABLE]
and denote by the sub-gradients of at in , that is, the set of those in such that for all in . For any in , it follows from classical convex analysis, see [34], that
[TABLE]
If the sub-gradient is a singleton – as in this paper – it is a gradient and we simplify the notation to \partial{\color[rgb]{0,0,1}f}(x^{\ast}).
2 Maximal Sub-Solutions of FBSDEs and Utility
A function is called a generator if it is jointly measurable, and is progressively measurable for any .444To prevent an overload of notations, we do not mention the dependence on and , that is, . A generator is said to satisfy condition (Std) if
- (Std)
is lower semi-continuous, convex with non-empty interior domain and gradients555Note that we could work with non-empty sub-gradients where by means of [35, Theorem 14:56] we could apply measurable selection theorem, see [18, Corollary 1C] to select measurable gradients in the sub-gradients of and working with them. everywhere on its domain (for every and ).
Remark 2.1**.**
Note that if satisfies the above assumptions, as a normal integrand, for every in the domain of and for every and , there exists and progressively measurable such that
[TABLE]
*for every , and , see Rockafellar and Wets [35, Chapter 14, Theorem 14.46]. These processes and are the partial derivatives of with respect to and , respectively. *
We further denote by
[TABLE]
For any terminal condition in , we call a pair where and a sub-solution of the backward stochastic differential equation if 666Note that the value process of a sub-solution is a-priori càdlàg hence can jump upwards at time . Therefore, when looking at maximal sub-solutions, considering sub-solutions with random endowment as done in [9] is equivalent to , as the latter is larger.
[TABLE]
The processes and are called the value and control processes, respectively. Sub-solutions are not unique. Indeed, is a sub-solution if and only if there exists an adapted càdlàg increasing process with such that
[TABLE]
which is given by
[TABLE]
As mentioned in the introduction, existence and uniqueness of a maximal sub-solution depend foremost on the integrability of the positive part of , admissibility conditions on the local martingale part, and the properties of the generator – positivity, lower semi-continuity, convexity in and monotonicity in or joint convexity in . In this paper though, we removed the condition on the generator in terms of positivity to the optimization problem we are looking at. In order to guarantee the existence and uniqueness of a maximal sub-solution, we need the following admissibility condition.
Definition 2.2**.**
*A sub-solution to (5) is called admissible if is in for every in . *
Given a terminal condition , we denote by
[TABLE]
the set of admissible sub-solutions of (5). A sub-solution in is called maximal sub-solution if for every , for every other sub-solution in . Our first result concerns the existence and uniqueness of a maximal sub-solution to (5).
Theorem 2.3**.**
Let a generator satisfying 5 and a terminal condition such that is in for every in . If is non empty, then there exists a unique maximal sub-solution in for which holds
[TABLE]
The proof of the Theorem relies on the same techniques as in [9] and is postponed into the Appendix A.
As mentioned in the introduction, we present in a financial framework how the maximal sub-solutions are related to the utility formulation problem. We consider a financial market consisting of one bond with interest rate [math] and a -dimensional stock price evolving according to
[TABLE]
where , is a -valued uniformly bounded drift process, and is a volatility matrix process. For simplicity, we assume that is invertible such that the market price of risk process
[TABLE]
Given a -dimensional trading strategy , the corresponding wealth process with initial wealth satisfies
[TABLE]
where which is a Brownian motion under where . To remove the volatility factor, we generically set and denote by the corresponding wealth process.
Lemma 2.4**.**
For every terminal condition in and in , it holds that is in where
[TABLE]
Proof 2.5**.**
Since is in , it follows from reverse Hölder inequality, see [25, Theorem 3.1], that there exists such that . Since is bounded and is a BMO martingale, we only need to show that is in for all . From in , it follows that is in , for all . Since is uniformly bounded, for any , it holds that
[TABLE]
for some constant . Therefore, it follows from Doob’s inequality that
[TABLE]
Given therefore a terminal condition in , for every in , according to Theorem 2.3 together with Lemma 2.4, it follows that if is non-empty, then there exists a unique maximal sub-solution to the forward backward stochastic differential equation
[TABLE]
We denote by the value of this maximal sub-solution at time [math], and convene that if is empty, then . It follows from the same argumentation as in [9, 8, 10], that is a concave increasing functional and therefore a utility operator777Furthermore, if is increasing in , then it satisfies the sub-cash additivity property, namely for every . A property introduced and discussed in [12]..
Remark 2.6**.**
It is known, see [21, Example 2.1], that – under some adequate smoothness conditions – the certainty equivalent can be described as the value at [math] of the maximal sub-solution of the backward stochastic differential equation
[TABLE]
*where is a positive jointly convex generator in many of the classical cases. For instance, for , , and for with and , it follows that for . *
Before we proceed to characterization of optimal strategies, let us point to a simple transformation that underlies the following section. For sub-solution in , the variable change , where leads to the following system of forward backward stochastic differential equation
[TABLE]
where . In the following we consistently use the notation and where is sub-solution of the utility problem.
3 Sufficient Characterization of the Coupled FBSDE System
We are interested in a utility maximization problem with random endowment in , for the utility function . In other terms, finding in such that
[TABLE]
We call such a strategy an optimal strategy to problem (10). Throughout, we call any trading strategy in an admissible strategy. We split this Section into two, namely a verification result and a characterization result in the spirit of [22] which has been done in the context of classical expected utility optimization.
3.1 Verification
Our first main result is a verification theorem for the optimal solution given by the solution of a fully coupled backward stochastic differential equation.
Theorem 3.1**.**
Suppose that there exists such that
[TABLE]
Suppose that the fully coupled forward backward system of stochastic differential equations
[TABLE]
admits a solution such that
- •
* is in ;*
- •
* satisfies is in for every in .*
- •
* is in where and ;*
Then, is an optimal strategy to problem (10) and
[TABLE]
Remark 3.2**.**
*The conditions on the gradient (11) together with the auxiliary BSDE in guarantees that the measure with density is orthogonal to the linear space of the wealth processes generated by the strategies in . Indeed, the auxiliary BSDE in is related to an orthogonal projection in terms of measure. *
Before addressing the proof of the theorem, let us show the following lemma concerning the auxiliary BSDE in characterizing the gradient of the optimal solution.
Lemma 3.3**.**
Let and . The backward stochastic differential equation
[TABLE]
admits a unique solution with in . In this case, if we define which is in , it follows that
[TABLE]
Proof 3.4**.**
According to Kobylanski [26], since is uniformly bounded, the backward stochastic differential equation
[TABLE]
admits a unique solution where is uniformly bounded and is in . According to Briand and Elie [2, Proposition 2.1] it also holds that is in which is also in since is in .888The space is invariant under measure change, see [25, Theorem 3.6]. The variable change and which is in yields
[TABLE]
showing the first assertion. Defining now , which is in , it follows that
[TABLE]
*Taking the exponential on both sides, yields (13). *
With this Lemma at hand, we are in position to address the proof of Theorem 3.1.
Proof 3.5** (Theorem 3.1).**
Let where is a solution of (12). Let further , where and adopt the notations , . Since , it follows that satisfies
[TABLE]
Now by assumption, is in and is in for every in . We deduce that is in and therefore . Furthermore, since , according to (4), it follows that g(Y^{\ast},Z^{\ast})=b^{\ast}Y^{\ast}+{\color[rgb]{1,0,0}c^{*}}\cdot Z^{\ast}-g^{\ast}(b^{\ast},c^{\ast}). Hence
[TABLE]
Since is in and in we deduce that
[TABLE]
As for the rest of the theorem, since is in , we are left to show that for any in and any in it follows that . Indeed, it would follows that
- •
* for every in and therefore ;*
- •
* for every in and every in showing that for every in .*
Let therefore in . Without loss of generality we may assume that is non-empty. Let in and denote by , and . According to Remark 2.1, it follows that . Hence
[TABLE]
By the change of variable and , it follows that satisfies999Recall, .
[TABLE]
since is a martingale as the difference of two martingales; being in . However, and satisfying the condition of Lemma 3.3, it follows that is in particular in . Hence, is a Brownian motion under the measure . Since , for , according to (13), we have
[TABLE]
*Thus, which ends the proof. *
Remark 3.6**.**
Note that the proof of the theorem shows in particular that the maximal sub-solution for the optimal utility is which satisfies a “linear”101010Naturally, the coefficients , and depend on , but are actually the gradients evaluated at the value of the optimal solution. backward stochastic differential equation
[TABLE]
Remark 3.7**.**
The case of utility optimization for the certainty equivalent or its equivalent formulation in terms of expected utility in a backward stochastic differential equation context has been the subject of several papers, in particular [22] and [21]. The optimal solutions provided in those papers each correspond to the coupled forward backward stochastic differential equation system of Theorem (3.1). Indeed, as mentioned in Remark 2.6, the generator corresponds to . In that context, the coupled system of forward backward stochastic differential equations in Theorem 3.1 corresponds to
[TABLE]
It turns out that , implies in that case that and therefore
[TABLE]
Under these conditions, the forward backward stochastic differential equation turns into
[TABLE]
*which coincide with the forward backward stochastic differential equation system in [22], noting that the auxiliary backward stochastic differential equation in disappears by a transformation. For classical utility functions such as exponential with random endowment, and power or logarithmic without endowment, the optimization problem can be solved by solving quadratic backward stochastic differential equations, see [23]. Their method relies on a “separation of variables” property shared by those classical utility functions. In the case of exponential utility, as seen in the first case study of Section 4 in the case where , our forward backward stochastic differential equation system reduces to a simple backward stochastic differential equation system. *
3.2 Characterization
Our second main result is a characterization theorem of optimal solutions in terms of the fully coupled system of forward backward stochastic differential equations presented in Theorem 3.1.
Theorem 3.8**.**
Suppose that in is an optimal strategy to problem (10). Denote by the corresponding maximal sub-solution to problem (10) for and denote as well as . Under the assumptions
- •
the sub-solution is a solution;
- •
the concave function , is differentiable at [math] for every in .
- •
* is in where and ;*
- •
*the point-wise implicit solution to is unique for every given , and ; *
then it holds that
[TABLE]
where is the unique solution with in of
[TABLE]
*In particular, the fully coupled forward backward stochastic differential equation system of Theorem 3.1 has a solution . *
Proof 3.9**.**
Let in . By assumption, the function is concave, admits a maximum at [math] and is differentiable at [math]. In particular, on a neighborhood of [math], is real valued. For in such neighborhood, we denote by the maximal sub-solution in . Since is in , it follows that is a martingale. By the same argumentation as in the proof of Theorem 3.1, it holds
[TABLE]
for every in a neighborhood of [math]. In particular is in the sub-gradient of at [math], which is equal to [math] since is concave, maximal at [math] and differentiable at [math]. It follows that
[TABLE]
Since is a strictly positive martingale in , by martingale representation theorem, it follows that
[TABLE]
for which, using the same argumentation methods as in the proof of Lemma 3.3, is in . Therefore, it holds that
[TABLE]
Hence
[TABLE]
showing that , -almost surely and therefore
[TABLE]
Since , we deduce that
[TABLE]
Defining
[TABLE]
shows that satisfies the auxiliary backward stochastic differential equation (14), which by means of Lemma 3.3 admits a unique solution. Hence
[TABLE]
*which by uniqueness of the point-wize solution implies that -almost surely. *
Remark 3.10**.**
*Existence of optimal strategies such that for every in are often showed using functional analysis and duality methods, see for instance [38, 27] for the case of expected utility. Present functionals given by maximal sub-solution of BSDEs, due to dual-representations [10], are also adequate to guarantee existence of optimal strategies as shown in [21]. As for the directional differentiability condition at the optimal solution , it is necessary to guarantee the identification of the optimal solution with its point-wise version. This condition is usually checked on case by case such as for the certainty equivalent. *
4 Financial Applications and Examples
In the following, we illustrate the characterization of Theorem 3.1 to different case study. We present explicit solutions for the optimal strategy in the complete and incomplete case for a modified exponential utility maximization and an application of which to illustrate the cost of incompleteness in terms of indifference when facing an incomplete market with respect to a complete one. We conclude by addressing recursive utility optimization which bears some particularity in terms of the gradient conditions.
4.1 Illustration: Complete versus Incomplete Market
The running example we will use is inspired from the dual representation in [10] where
[TABLE]
According to this dual representation in terms of discounting and probability uncertainty, we consider the simple example where
[TABLE]
where
- •
is a positive bounded predictable process;
- •
is also a positive predictable process strictly bounded away from [math] by a constant;
Note that even if we consider a discounting factor , there is no uncertainty about him particularly. This is an example of a sub-cash additive valuation instead of the classical cash-additive one, see [12]. If and is constant, then we have a classical exponential utility optimization problem. We therefore have
[TABLE]
To simplify the comparison between the complete and incomplete market, we assume that we have a simplified market with stocks following the dynamic
[TABLE]
where is the identity. In other terms the randomness driving stock is the Brownian motion . It follows that which is uniformly bounded. In the complete case, the agent can invest in all the stocks while in the incomplete case it is limited to the first stocks.
Complete Market:
With the generator given as in Equation (15), it follows that
[TABLE]
In particular, . Therefore, in order to find an optimal solution to the optimization problem, since which is in , it is sufficient to solve the following coupled forward backward stochastic differential equation
[TABLE]
with solution satisfying
- •
is in ;
- •
is in where and ;
- •
is in for all in .
One can easily deduce that the last backward stochastic differential equation admits a unique solution with in due to the assumption on , see [23]. To provide an explicit solution,
- •
We further assume that is bounded.
Remark 4.1**.**
This is in particular the case if is solution of the following quadratic backward stochastic differential equation
[TABLE]
for some . Indeed, in that case which is bounded. If in addition where is a bounded Lipschitz function, then is bounded, see [5]. Conversely, since is bounded, hence in , if is bounded, is the unique solution of the following backward stochastic differential equation
[TABLE]
Defining
[TABLE]
and noting that
[TABLE]
it follows that is bounded and we choose the constant such that .111111That is
Thus, by martingale representation theorem, there exists a predictable process in such that . Defining
[TABLE]
it follows that is solution of the forward backward stochastic differential equation. We are left to check that this solution satisfies the integrability conditions. First, is in . Second, is bounded hence . Third, and
[TABLE]
therefore, it holds that
[TABLE]
Thus . Finally, in order to show that is in for all in , according to Remark A.2, we only need to check that for every , is in , which follows directly from a similar technique as in Lemma 2.4 noting that
[TABLE]
Thus, is an optimal solution to the optimization problem.
Remark 4.2**.**
In terms of utility optimization, since , it follows that
[TABLE]
Remark 4.3**.**
*Instead of assuming that is bounded, we can still have an explicit solution if is deterministic similarly as in the incomplete market, in which we will give the detailed method to get the solution. *
Incomplete Market:
Still with the generator given as in Equation (15) but now in the incomplete case – that is and – it follows that
[TABLE]
In particular, . Here again , and since , in order to find an optimal solution to the optimization problem, it is sufficient to solve the following coupled forward backward stochastic differential equation
[TABLE]
with solution satisfying
- •
is in ;
- •
where and ;
- •
is in for all .
In order to provide an explicit solution as in the complete market
- •
we assume here that is deterministic;
First, if we assume a-priori that is in , since is deterministic, the last backward stochastic differential equation admits a unique solution with in . Indeed, the following quadratic BSDE
[TABLE]
admits a unique solution with in since is bounded, see [23]. Therefore,
[TABLE]
satisfies the following quadratic BSDE
[TABLE]
with in .
It follows that the system is solved for
[TABLE]
The fact that the conditions of Theorem 3.1 are fulfilled follows the same argumentation as in complete market.
Remark 4.4**.**
Again, in terms of utility optimization, we obtain that
[TABLE]
The Cost of Incompleteness
The computation of explicit portfolio optimal strategies allows to address further classical financial problems such as utility indifference pricing. Given a contingent claim , we are looking at the start wealth such that
[TABLE]
where is the corresponding optimal strategy. In other terms, represents the value in terms of indifference pricing one is willing to pay to reach the same utility by having access to a financial market. Since our functional is only upper semi-continuous, and to distinguish between complete and incomplete markets we proceed as follows.
[TABLE]
which represents the utility indifference amount of wealth to be indifferent for in the complete and incomplete case, respectively. Intuitively, the amount of wealth necessary to reach the same utility level is higher in the incomplete case, that is . This is indeed the case since is a subset of .
In the case of the previous example where an explicit solution stays at hand we have the following explicit costs of having a restricted access to the financial market. Indeed, in the case where is deterministic, according to Equations 16 and 17 we obtain
[TABLE]
On the other hand, according to (17) it holds
[TABLE]
We deduce that
[TABLE]
4.2 Inter-Temporal Resolution of Uncertainty
We conclude with a classical utility functional having some interesting particularity in terms of gradient characterization. To address inter-temporal resolution of uncertainty, Kreps and Porteus [28] introduced a new class of inter-temporal utilities that weight immediate consumption against later consumptions and random payoffs. This idea has been extended in particular by Epstein and Zin [15] in the discrete case and later on by Duffie and Epstein [11] in the continuous case in terms of backward stochastic differential equations. Given a cumulative consumption stream , positive increasing and right continuous function, a commonly used example of inter-temporal generator of a recursive utility is given by
[TABLE]
where and . We refer to [11] for the interpretation, properties and derivation of this generator and the corresponding constants. Note that this generator is concave in if , assumption we will keep. In the classical setting, the generator is represented in terms of utility with a positive sign in the backward stochastic differential equation. In our context in terms of costs with , and we define
[TABLE]
which is a convex function in and where . In terms of costs, given a deterministic right continuous increasing consumption stream , the agent weight infinitesimally the opportunity to consume today weighted with a parameter with a rest certainty equivalent of consumption tomorrow to the power against the cost in terms of certainty equivalent if waiting tomorrow and not consuming. The recursive utility with terminal payoff is given as the maximal sub-solution of
[TABLE]
In this context, given a random payoff , start wealth , and consumption stream , the agent tries to optimize its recursive utility in terms of investment strategy against its consumption choice . For the sake of simplicity we consider the simple case of a complete market. The particularity of recursive utilities is that the generator usually do not depend on . It follows that the condition enforces the condition in terms of auxiliary backward stochastic differential equation
[TABLE]
Since
[TABLE]
we can assume that where is a deterministic function. Then it follows that
[TABLE]
showing that
[TABLE]
Setting
[TABLE]
from , we deduce that if is solution of the ordinary differential equation
[TABLE]
then the system has an optimal solution.
Appendix A Existence and uniqueness of maximal sub-solutions
Proof A.1** (of Theorem 2.3).**
Throughout this proof, we use the notation
[TABLE]
Recall that is a sub-solution if and only if there exists an adapted càdlàg increasing process with such that
[TABLE]
which is given by
[TABLE]
We prove the theorem in several steps
- Step 1:
For any in and in , defining , and , it follows that . Indeed, using Ito’s formula, it follows that satisfies
[TABLE]
where
[TABLE]
On the one hand, since is positive and is in , it holds
[TABLE]
On the other hand, once again since is positive, by assumption , as well as are in , we have
[TABLE]
showing that is in . 2. Step 2:
Let be a sequence in , a stopping time and be a partition in . Suppose that , for all , then it follows that
[TABLE]
is such that is in . It is clear that satisfies the sub-solution system (5). Let us show that it is admissible in the sense of . For in we denote , and for every . From the previous computations, we have that for every where
[TABLE]
We deduce from (18) that
[TABLE]
and therefore is a sub-martingale. 3. Step 3:
The same argumentation can be done when the sequence is taken in since we only look at the sub-martingale property. Hence, is stable under upward pasting. 4. Step 4:
Following the construction in **[9, Step 2 and 8 of Theorem 4.1]**, we get a sequence of elements in such that the càdlàg version of the time wise essential supremum along dyadic partition of . Furthermore, fixing in , we can follow **[9, Step 3 - 7 of Theorem 4.1]** to construct a subsequence in the asymptotic convex hull such that -almost surely. Following **[9, Step 8 and first part of Step 9 of Theorem 4.1]**, we can verify that is a sub-solution for the system (5). We are left to verify the admissibility condition for . 5. Step 5:
Note that in the construction of the approximating sequence where , since is non empty, we can assume that is in and it holds . Let in and denote by , and as well as , and for all . On the one hand, since as defined in (19) in the first step is positive, is a sub-martingale, as well as are in , we have
[TABLE]
Therefore, according to (18), it holds
[TABLE]
In particular is a sub-martingale and therefore is in . On the other hand, following (18), defining
[TABLE]
It follows that is an increasing càdlàg process starting at [math]. Using the sub-martingale property of , we get that
[TABLE]
Hence is in . It follows that
[TABLE]
Since is in , according to the first step we have that is in . Hence is in . From both inequality we deduce that
[TABLE]
Remark A.2**.**
Note that from this proof, if is a sub-solution (5), then for every in , is in if and only if is in . Moreover, if — which is the case whenever — since is in and
[TABLE]
*it follows that is in implies is in . *
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Bordigoni et al. [2007] G. Bordigoni, A. Matoussi, and M. Schweizer. Stochastic Analysis and Applications, The Abel Symposium 2005 , chapter A Stochastic Control Approach to a Robust Utility Maximization Problem, pages 125–151. Springer Berlin Heidelberg, 2007.
- 2Briand and Elie [2013] P. Briand and R. Elie. A simple constructive approach to quadratic BSD Es with or without delay. Stochastic Processes and their Applications , 123(8):2921–2939, 2013.
- 3Cerreia-Vioglio et al. [2011] S. Cerreia-Vioglio, F. Maccheroni, M. Marinacci, and L. Montrucchio. Uncertainty averse preferences. Journal of Economic Theory , 146(4):1275–1330, 2011.
- 4Chen and Epstein [2002] Z. Chen and L. G. Epstein. Ambiguity, risk, and asset returns in continuous time. Econometrica , 70(4):1403–1443, 2002.
- 5Cheridito and Nam [2014] P. Cheridito and K. Nam. Bsdes with terminal conditions that have bounded malliavin derivative. Journal of Functional Analysis , 266:1257–1285, 2014.
- 6Cvitanić et al. [2001] J. Cvitanić, W. Schachermayer, and H. Wang. Utility maximization in incomplete market with random endowment. Finance and Stochastics , 5:259–272, 2001.
- 7Drapeau and Kupper [2013] S. Drapeau and M. Kupper. Risk preferences and their robust representation. Mathematics of Operations Research , 28(1):28–62, 2013.
- 8Drapeau and Mainberger [2016] S. Drapeau and C. Mainberger. Stability and markov property of forward backward minimal supersolutions. Electronic Journal of Probability , 21(41):1–15, 2016.
