Skip to main content
Springer Nature - PMC COVID-19 Collection logoLink to Springer Nature - PMC COVID-19 Collection
. 2020 May 25;12143:575–589. doi: 10.1007/978-3-030-50436-6_43

Multidimensional BSDEs with Mixed Reflections and Balance Sheet Optimal Switching Problem

Rachid Belfadli 15, M’hamed Eddahbi 16, Imade Fakhouri 17,, Youssef Ouknine 18,19,20
Editors: Valeria V Krzhizhanovskaya8, Gábor Závodszky9, Michael H Lees10, Jack J Dongarra11, Peter M A Sloot12, Sérgio Brissos13, João Teixeira14
PMCID: PMC7304763

Abstract

In this paper, we study a system of multidimensional coupled reflected backward stochastic differential equations (RBSDEs) with interconnected generators and barriers and mixed reflections, i.e. oblique and normal reflections. This system of equations is arising in the context of optimal switching problem when both sides of the balance sheet are considered. This problem incorporates both the action of switching between investment modes and the action of abandoning the investment project before its maturity once it becomes unprofitable. Pricing such real options (switch option and abandon option) is equivalent to solve the system of coupled RBSDEs considered in the paper, for which we show the existence of a continuous adapted minimal solution via a Picard iteration method.

Keywords: Real options, Optimal switching, Balance sheet, Trade-off strategies, Merger and acquisition, Backward SDEs, Mixed reflections

Introduction

Optimal switching problem (OSP) has attracted a lot of interest in the recent years (see among others [1, 2, 57, 11, 12]), since it can be related to many practical applications, for example the problem of valuation investment opportunities. OSP consists in finding an optimal management strategy for a production company that can run in m, Inline graphic, different modes. A management strategy Inline graphic is a combination of a nondecreasing sequence of stopping times Inline graphic, and a sequence of random variables Inline graphic taking values in the set of possible production modes Inline graphic. At time Inline graphic, in order to maximize the profit of the company, the manager decides to switch the production from the current mode Inline graphic to Inline graphic. When the production of the company is working under a strategy Inline graphic, it generates a gain equal to Inline graphic. The OSP amounts to finding an optimal management strategy Inline graphic such that Inline graphic. The OSP is connected with multidimensional RBSDEs with oblique reflections and interconnected barriers.

One dimensional BSDEs with normal reflections were first introduced by [10]. The multidimensional case was studied by Gegout-Petit and Pardoux [9], and then further investigated in many other works see e.g. [8, 13]. Multidimensional BSDEs with oblique reflections occurring in the context of OSPs were first introduced by [12]. They consider RBSDEs with generator taking the form Inline graphic and barrier Inline graphic where Inline graphic are constant switching costs and Inline graphic. Later, Hamadène and Zhang [11] generalized the preceding work by considering general generators and barriers of the following types Inline graphic and Inline graphic. Xu [17] dealt with the same kind of RBSDEs but when the generator, which is discontinuous w.r.t. Inline graphic, and the barrier take respectively the following forms Inline graphic and Inline graphic. Then, Aazizi et al. [1] extended the results of [17] to the case of generators and barriers of the form Inline graphic and Inline graphic.

In this paper, we are interested by Balance sheet OSP (BSOSP) which is a combination between the classical OSP described above and optimal stopping involving the balance sheet. BSOSP incorporates both the action of switching between modes and the action of abandoning a project once it becomes unprofitable. There are only few papers dealing with BSOSPs. Djehiche and Hamdi [4] considered the 2-modes case, i.e. Inline graphic. Their generators are of the form Inline graphic, Inline graphic and their barriers of type Inline graphic and Inline graphic, where Inline graphic and Inline graphic are switching costs and Inline graphic. Recently, the BSOSP multi-modes case was solved by Eddahbi et al. [5] when the barriers are of the form Inline graphic and Inline graphic (see Eddahbi et al.  [6] for the mean–field case).

Now, let us describe precisely the problem studied in this paper by introducing some notations. Let Inline graphic be a given real number, and Inline graphic is a fixed probability space endowed with a d–dimensional Brownian motion Inline graphic. Inline graphic is the natural filtration of the Brownian motion augmented by the Inline graphic–null sets of Inline graphic. All the measurability notion will refer to this filtration. The euclidean norm of a vector Inline graphic is denoted |z|. Furthermore, we introduce the following spaces of processes. Inline graphic is the space of Inline graphic–valued processes Inline graphic, such that Inline graphic. Inline graphic (resp. Inline graphic) is the set of Inline graphic–valued adapted and continuous (resp. càdlàg ) processes Inline graphic such that Inline graphic Inline graphic is the set of Inline graphic–valued, progressively measurable processes Inline graphic such that Inline graphic Inline graphic (resp. Inline graphic) is the set of non-decreasing processes K, satisfying Inline graphic and that belong to Inline graphic Inline graphic.

Next, to illustrate the BSOSP studied in this paper, let us deal with a concrete example. Consider a company that has m modes of production (if Inline graphic, minimal, average and maximal production modes). The manager of the company has two options. A switch option, i.e. in order to maximize its global profit, she switches the production between the modes depending on their random performances but this switching incorporates a cost called switching cost. The manager has also an abandon option i.e. stop the production once it becomes unprofitable.

More precisely, being in mode Inline graphic, one have to switch at time t to another mode Inline graphic, once we have that the expected profit Inline graphic in this mode falls below the following barrier

graphic file with name M63.gif 1

where Inline graphic is nonlinear random function (a special case is when Inline graphic, where Inline graphic is a switching cost from mode i to mode j), Inline graphic is the expected cost in mode i, and Inline graphic is the cost incurred when exiting/terminating the production while in mode i. Since we consider both sides of the balance sheet, the manager has to switch at time t to another mode Inline graphic, as soon as the expected cost in mode i, Inline graphic rises above the following barrier

graphic file with name M71.gif 2

where Inline graphic is a cost of default (i.e. in this case the project is no longer profitable and thus leads to the abandon of this latter even before its maturity), and Inline graphic is the benefit incurred when exiting/terminating the production while in mode i. It is well known that the BSOSP can be formulated using the following system of Snell envelopes

graphic file with name M74.gif 3
graphic file with name M75.gif 4

where Inline graphic are Inline graphic–stopping times which represent the exit times from the production in mode i, Inline graphic and Inline graphic denote respectively the running profit and cost per unit time dt and Inline graphic and Inline graphic are respectively the values at time T of the profit and the cost yields.

The BSOSP consists in showing existence and uniqueness of the processes

Inline graphic and also proving that the following stopping times are optimal

graphic file with name M83.gif

Since the Snell envelope is strongly connected to RBSDEs, solving the BSOSP is equivalent to showing existence of continuous solution to the following general (since we take Inline graphic Inline graphic where Inline graphic, Inline graphic) system of BSDEs with mixed reflections: for Inline graphicgraphic file with name 500810_1_En_43_Figa_HTML.jpgwhere T is called the time horizon, Inline graphic and Inline graphic are called the terminal conditions, the random functions Inline graphic and Inline graphic are respectively Inline graphic–progressively measurable for each Inline graphic, called the generators. Inline graphic is a real nonlinear random function, and Inline graphic, Inline graphic, and Inline graphic are previously given Inline graphic–adapted processes with some suitable regularity. The unknowns are the processes Inline graphic which are required to be Inline graphic–adapted. Moreover, Inline graphic and Inline graphic are non-decreasing processes. The second condition in (5) (resp. (6)) says that the first component Inline graphic (resp. Inline graphic) of the solution of RBSDE (5) (resp. (6)) is forced to stay above (resp. below) the barrier Inline graphic (resp. Inline graphic). The role of Inline graphic (resp. Inline graphic) is to push Inline graphic (resp. Inline graphic) upwards (resp. downwards) in order to keep it above (resp. below) the respective barrier in a minimal way in the sense of the third condition of RBSDE (5) (resp. (6)) which is called the minimal boundary condition i.e. Inline graphic (resp. Inline graphic) increases only when Inline graphic (resp. Inline graphic) touches the respective barrier.

Let us make precise the notion of a solution of the system of RBSDEs (S).

Definition 1

A 6-uplet of processes Inline graphic is called solution of the system of RBSDEs (S) if the two triples Inline graphic and Inline graphic belong to Inline graphic and satisfy the system (S).

The main contribution of our paper is to establish the existence of a continuous minimal adapted solution to system of RBSDEs (S). To this end we use a Picard iteration method (see El Karoui et al. [10] for more details). Uniqueness of the solution does not hold, since it is not verified even for the two-modes case and for a less general form of RBSDE (S) (see the counter-example in [4, subsection 3.1]).

Clearly, our results generalize the related works in the literature, since our RBSDE (S) is more general in many features. Actually, the expected profits and cost yields Inline graphic and Inline graphic are respectively interconnected in the generators Inline graphic and Inline graphic. This dependence can be interpreted as a nonzero-sum game problem, where the players’ utilities affect each other. Furthermore, the solutions Inline graphic and Inline graphic are also interconnected in the barriers. Note that, the general barrier Inline graphic which is random and nonlinear, makes the dependence on the unknown process implicit. This, allows one to consider more general switching cost, for instance in the case of risk sensitive switching problem.

The remainder of the paper is organized as follows. Section 2 is devoted to the assumptions. In Sect. 3, we state and prove the main result of the paper.

Assumptions

Let us introduce the following assumptions:

[H1]: For each Inline graphic, Inline graphic and Inline graphic satisfies:

  • (i)

    Inline graphic.

  • (ii)

    The mappings Inline graphic and Inline graphic are Lipschitz continuous in Inline graphic uniformly in t, and are continuous in Inline graphic for Inline graphic.

  • (iii)

    Inline graphic and Inline graphic are increasing in Inline graphic for Inline graphic. This assumption means that the m-players are partners.

[H2]: For each Inline graphic, Inline graphic satisfies:

  • (i)

    Inline graphic is continuous in (ty);

  • (ii)

    Inline graphic is increasing in y;

  • (iii)

    Inline graphic.

  • (iv)

    There is no sequence Inline graphic, Inline graphic, and Inline graphic such that Inline graphic, Inline graphic, Inline graphic. This means that there is no free loop of instantaneous switchings.

[H3]: For Inline graphic and Inline graphic, Inline graphic, Inline graphic and Inline graphic belong to Inline graphic.

[H4]: For any Inline graphic the random variables Inline graphic and Inline graphic are Inline graphic–measurable and belong to Inline graphic. Moreover we assume that

graphic file with name M162.gif

[H5]: For every Inline graphic, the processes Inline graphic and Inline graphic are semimartingales of the form Inline graphic and

Inline graphic where Inline graphic and Inline graphic are respectively Inline graphic and Inline graphic-valued Inline graphic–progressively measurable processes which are Inline graphic–square integrable.

Main Result

Next we state and prove the main result of this paper.

Theorem 1

Assume that [H1][H5] hold. Then for all Inline graphic, the system of RBSDEs (S) admits a continuous minimal solution Inline graphic.

Proof

The whole proof is performed in six steps.

Step 1: Construction of Picard’s sequence of solutions

Consider the following sequence of RBSDEs defined recursively, for Inline graphic and Inline graphic, as follows: For Inline graphic we start with the following BSDE:

graphic file with name M179.gif 7

and RBSDE: graphic file with name 500810_1_En_43_Figb_HTML.jpgwhere Inline graphic Now, for Inline graphic consider the following system of RBSDEs:graphic file with name 500810_1_En_43_Figc_HTML.jpgNote that by [H1](i) and (ii) we have that Inline graphic and Inline graphic are uniformly Lipschitz continuous in Inline graphic and satisfy the following integrability condition

graphic file with name M185.gif

Thus, from [14] it follows that for each Inline graphic BSDE (7) admits a unique solution Inline graphic. Thus, there exists a constant Inline graphic such that

graphic file with name M189.gif 10

and thus in view of [10, Proposition 2.3] we deduce that RBSDE (8) has a unique solution Inline graphic.

As a by product, under the assumptions [H1][H4], in view of [10, Proposition 2.3] the solution Inline graphic exists and is unique. This in turn, in view of the following estimate, which holds due to assumption [H2](iii), [H3] and the fact that Inline graphic,

graphic file with name M193.gif

combined with [10, Proposition 2.3], leads to the existence of the unique solution

Inline graphic.

Next, for Inline graphic, consider the following systemgraphic file with name 500810_1_En_43_Figd_HTML.jpgBased on the arguments used previously, we can show by using an induction argument that for any Inline graphic, the system of RBSDEs (11) has a unique solution

graphic file with name M197.gif

Step 2: Convergence of the sequences Inline graphic

Let us set,

graphic file with name M199.gif

Note that by [H1](i) and (ii) we have that Inline graphic and Inline graphic are uniformly Lipschitz continuous in Inline graphic and satisfy the following integrability condition

graphic file with name M203.gif 12

Consider the following BSDE

graphic file with name M204.gif

It follows from [14] that this BSDE admits a unique solution Inline graphic. Next, let Inline graphic be solutions of the following system of reflected BSDEs, for any Inline graphic and Inline graphic, as followsgraphic file with name 500810_1_En_43_Fige_HTML.jpgBy using previous arguments, and thanks to the fact that Inline graphic and assumption [H3], applying [1, Theorem 3.1] yields that this RBSDE admits a solution Inline graphic. Moreover, the following holds Next, by using an induction argument, plus a repeated use of the comparison theorem, we can easily show that for any Inline graphic, Inline graphic, Inline graphic:

graphic file with name M214.gif 14

Consequently, we deduce the following

graphic file with name M215.gif 15
graphic file with name M216.gif 16

Next, from (14) combined with (15) and (16) we deduce that the sequences Inline graphic and Inline graphic admit limits. Therefore, let Inline graphic and Inline graphic, Inline graphic be two optional processes which are respectively the limits of Inline graphic and Inline graphic.

Applying Fatou’s Lemma and the dominated convergence theorem, we obtain

graphic file with name M224.gif 17

Step 3: Uniform estimates for the sequences. Inline graphic, Inline graphic

By [H2](iii), we obtain in view of the facts Inline graphic, Inline graphic and (14) combined with [H3] the following estimate of the barriers of RBSDE (11): for all Inline graphic and all Inline graphic

graphic file with name M231.gif 18
graphic file with name M232.gif 19

Finally, with the estimates (15), (16), (18) and (19) at hand, applying the results in [10] we obtain that

graphic file with name M233.gif 20

Step 4: Continuity of the limit processes. Inline graphic and Inline graphic, Inline graphic

To this end, let us first establish the absolute continuity of the increasing process Inline graphic w.r.t t for every Inline graphic.

We will first show that the claim holds true for Inline graphic. Let

graphic file with name M240.gif

Applying Itô–Tanaka formula to Inline graphic, and in view of assumption Inline graphic we obtain

graphic file with name M243.gif 21

where Inline graphic is the local time at 0 of the continuous semimartingale Inline graphic,

graphic file with name M246.gif

and

graphic file with name M247.gif

Note that Inline graphic and Inline graphic are uniformly Lipschitz continuous in Inline graphic. Thus, using the fact that Inline graphic and Inline graphic belong respectively to Inline graphic, yields that there is a constant Inline graphic such that

graphic file with name M255.gif 22

Moreover, in view of the above and assumption Inline graphic, there exists a constant Inline graphic such that

graphic file with name M258.gif 23

Then, applying [10, Proposition 4.2] yields for all Inline graphic

graphic file with name M260.gif 24

which means that, Inline graphic is absolutely continuous w.r.t. t. Next, in the same spirit, we can show, thanks to [10, Proposition 4.2], for all Inline graphic that the process Inline graphic is absolutely continuous w.r.t. t. Furthermore, we can obtain that: there exists a constant Inline graphic such that for all Inline graphic and Inline graphic,

graphic file with name M267.gif 25

Notice that, by combining [H1](ii) together with (15), (16), (20) we obtain that there is a constant Inline graphic such that

graphic file with name M269.gif 26

Next, in view of estimates (20), (25) and (26), we deduce that there exists a subsequence along which all Inline graphic, Inline graphic and

Inline graphic converge weakly in their respective spaces Inline graphic, Inline graphic and Inline graphic to the processes Inline graphic, Inline graphic and Inline graphic.

Next, for any Inline graphic and any stopping time Inline graphic we have

graphic file with name M281.gif

Taking the weak limits in each side and along this subsequence yields

graphic file with name M282.gif

Since the processes appearing in each side are optional, using the Optional Section Theorem (see e.g. [3], Chapter IV pp.220), it follows that

graphic file with name M283.gif 27

Therefore, the process Inline graphic is continuous. Relying both on Dini’s Theorem and on Lebesgue’s dominated convergence one (17), we also get that

graphic file with name M285.gif 28

We will now focus on the continuity of the sequence of processes Inline graphic, Inline graphic. Actually, applying Peng’s Monotone Limit Theorem (see [15]) yields that for every Inline graphic, the limit process Inline graphic is càdlàg . Based on what has been already shown in previous steps, by mimicking the arguments of [15] we can easily show that there exist two processes Inline graphic and Inline graphic such that Inline graphic satisfies the first equation of RBSDE (S). Moreover, passing to the limit in the fifth inequality of RBSDE (11), implies that Inline graphic Thus, for Inline graphic, Inline graphic satisfies

graphic file with name M296.gif 29

It remains to prove the minimal boundary condition. Next, consider the following RBSDE whose solution exists thanks to [16]:

graphic file with name 500810_1_En_43_Figf_HTML.jpg

Note that RBSDEs (29) and (30) have the same lower barrier. In fact, since Inline graphic is the smallest Inline graphic–supermartingale with lower barrier Inline graphic, we have that for any Inline graphic, Inline graphic (see [16, Theorem 2.1]). On the other hand since for any Inline graphic and Inline graphic, Inline graphic and Inline graphic, applying the comparison theorem in view of [H2](ii) yields that Inline graphic, and then passing to the limit implies that Inline graphic. Summing up we have that for any Inline graphic Inline graphic. From the uniqueness of the Doob-Meyer decomposition, it follows that Inline graphic, Inline graphic–a.s., and Inline graphic for any Inline graphic, Inline graphic–a.s. Then, for Inline graphic, Inline graphic satisfies RBSDE (5) but with the following minimal boundary condition

graphic file with name M317.gif 31

From the first equation of (29) and since the process Inline graphic is increasing, it follows that Inline graphic Assume that Inline graphic, for some Inline graphic. Thus Inline graphic. From the minimality condition (31), we have

graphic file with name M323.gif

Let Inline graphic be the optimal index for which the maximum is attained. Thus,

graphic file with name M325.gif 32

This obviously yields that Inline graphic and thus Inline graphic. Repeating the above procedure we obtain for Inline graphic

graphic file with name M329.gif

Since each Inline graphic can take only values in Inline graphic which is a finite set, then there must be a loop in Inline graphic. we may assume w.l.o.g. that Inline graphic for some Inline graphic noting again that the Inline graphic’s are mutually different i.e. for each k, Inline graphic. Therefore, we have Inline graphic and Inline graphic This contradicts assumption [H2](iv). Consequently, Inline graphic. Hence, the processes Inline graphic and Inline graphic, Inline graphic are continuous.

Step 5: Identification of the limit

Next, we show that

graphic file with name M343.gif

Actually, since Inline graphic and Inline graphic is continuous then relying both on Dini’s Theorem and on Lebesgue’s dominated convergence one (17), we get that

graphic file with name M346.gif 33

Further, we can easily show by applying Itô’s formula to Inline graphic Inline graphic and using standard arguments (see e.g. [10]) that

graphic file with name M349.gif

From this, and [H1](ii) combined with (27), (28) it holds that

graphic file with name M350.gif

Next, passing to the limit in the second inequality of RBSDE (11), yields that Inline graphic Furthermore, thanks to the weak convergence of Inline graphic to the process Inline graphic and the strong convergences (28) and (33), we deduce that

graphic file with name M354.gif

In fact, this implies that Inline graphic is a solution to the second part of RBSDE (S). Summing up Inline graphic is a solution of RBSDE (S). Finally, it remains to show that this solution is the minimal one.

Step 6: Minimality of the solution of RBSDE (S)

Let Inline graphic be another solution of RBSDE (S). Since Inline graphic and Inline graphic, for all Inline graphic, and thanks to the monotonicity of Inline graphic applying the comparison theorem yields that for each Inline graphic: Inline graphic and Inline graphic, for all Inline graphic. Passing to the limit when Inline graphic implies that for each Inline graphic: Inline graphic and Inline graphic, which is the desired result. This ends the proof of Theorem 1.

Conclusion and Perspectives

In this paper we have proved the existence of a continuous minimal solution to RBSDE (S) which is arising from BSOSPs. Let us comment on a possible generalization of the results obtained in this paper. Actually, the full balance sheet case is still an open problem and constitutes a challenge. By the full balance sheet case we mean that we consider the two sides of the balance sheet. Indeed, in this case the expected cost in mode i, Inline graphic should rise above the following barrier

graphic file with name M371.gif 34

instead of Inline graphic where Inline graphic is a real nonlinear random function satisfying [H2], except for [H2]–(iii) which is replaced by Inline graphic. We want to stress out that, the new assumption [H2] is satisfied when Inline graphic takes the particular form Inline graphic where Inline graphic is the switching cost from mode i to mode j.

A full BSOSP amounts to establishing existence of a continuous solution to the system of RBSDEs (S), but with the upper barrier (34) for Inline graphic. Note that, as in the proof of Theorem 1 (Step 4) the absolute continuity of the process Inline graphic w.r.t. t will play a primordial role to derive convergence of the corresponding approximating sequence. To do so we need to use the Itô–Tanaka formula (see Step 4), which makes it difficult to solve the system of RBSDEs (S) for the full balance sheet case. Note that even in the case when the functions Inline graphic and Inline graphic take the particular forms respectively Inline graphic and Inline graphic let alone the general case, the question of existence of solutions to the corresponding system of RBSDEs (S) for the full balance sheet case, is still open. This issue was discussed in [5] and in [6] in the mean field case.

Acknowledgment

The second named author extends his appreciation to the Deanship of Scientific Research at King Saud University for funding this work through research group no (RG-1441-339).

Contributor Information

Valeria V. Krzhizhanovskaya, Email: V.Krzhizhanovskaya@uva.nl

Gábor Závodszky, Email: G.Zavodszky@uva.nl.

Michael H. Lees, Email: m.h.lees@uva.nl

Jack J. Dongarra, Email: dongarra@icl.utk.edu

Peter M. A. Sloot, Email: p.m.a.sloot@uva.nl

Sérgio Brissos, Email: sergio.brissos@intellegibilis.com.

João Teixeira, Email: joao.teixeira@intellegibilis.com.

Rachid Belfadli, Email: r.belfadli@uca.ma.

M’hamed Eddahbi, Email: meddahbi@ksu.edu.sa.

Imade Fakhouri, Email: imade.fakhouri@um6p.ma.

Youssef Ouknine, Email: ouknine@uca.ac.ma, Email: youssef.ouknine@um6p.ma.

References

  • 1.Aazizi S, El Mellali T, Fakhouri I, Ouknine Y. Optimal switching problem and related system of BSDEs with left-Lipschitz coefficients and mixed reflections. Statist. Probab. Lett. 2018;137:70–78. doi: 10.1016/j.spl.2018.01.006. [DOI] [Google Scholar]
  • 2.Aazizi S, Fakhouri I. Optimal switching problem and system of reflected multi-dimensional FBSDEs with random terminal time. Bull. Sci. Math. 2013;137(4):523–540. doi: 10.1016/j.bulsci.2012.11.006. [DOI] [Google Scholar]
  • 3.Dellacherie C, Meyer P-A. Probabilités et potentiels. Paris: Chapter I-IV. Hermann; 1975. [Google Scholar]
  • 4.Djehiche B, Hamdi A. A full balance sheet two-mode optimal switching problem. Stochastics. 2015;87(4):604–622. doi: 10.1080/17442508.2014.991324. [DOI] [Google Scholar]
  • 5.Eddahbi M, Fakhouri I, Ouknine Y. A balance sheet optimal multi-modes switching problem. Afr. Mat. 2020;31(2):219–236. doi: 10.1007/s13370-019-00719-7. [DOI] [Google Scholar]
  • 6.Eddahbi M, Fakhouri I, Ouknine Y. Mean-field optimal multi-modes switching problem: a balance sheet. Stoch. Dyn. 2019;19(4):1950026. doi: 10.1142/S0219493719500266. [DOI] [Google Scholar]
  • 7.El Asri B, Fakhouri I. Viscosity solutions for a system of PDEs and optimal switching. IMA J. Math. Control Inform. 2017;34(3):937–960. doi: 10.1093/imamci/dnw004. [DOI] [Google Scholar]
  • 8.Fakhouri I, Ouknine Y, Ren Y. Reflected backward stochastic differential equations with jumps in time-dependent random convex domains. Stochastics. 2018;90(2):256–296. doi: 10.1080/17442508.2017.1346654. [DOI] [Google Scholar]
  • 9.Gegout-Petit A, Pardoux É. Equations différentielles stochastiques rétrogrades réfléchies dans un convexe. Stochast. Stochast. Rep. 1996;57:111–128. doi: 10.1080/17442509608834054. [DOI] [Google Scholar]
  • 10.El Karoui N, Kapoudjian C, Pardoux E, Peng S, Quenez M-C. Reflected solutions of backward SDEs and related obstacle problems for PDEs. Ann. Probab. 1997;25(2):702–737. doi: 10.1214/aop/1024404416. [DOI] [Google Scholar]
  • 11.Hamadène S, Zhang J. Switching problem and related system of reflected backward stochastic differential equations. Stochastic Process. Appl. 2010;120:403–426. doi: 10.1016/j.spa.2010.01.003. [DOI] [Google Scholar]
  • 12.Hu Y, Tang S. Multi-dimensional BSDE with oblique reflection and optimal switching. Probab. Theory Related Fields. 2010;147(1–2):89–121. doi: 10.1007/s00440-009-0202-1. [DOI] [Google Scholar]
  • 13.Ouknine Y. Reflected backward stochastic differential equations with jumps. Stochast. Stochast. Rep. 1998;65:111–125. doi: 10.1080/17442509808834175. [DOI] [Google Scholar]
  • 14.Pardoux E, Peng S. Adapted solution of a backward stochastic differential equation. Syst. Control Lett. 1990;14:55–61. doi: 10.1016/0167-6911(90)90082-6. [DOI] [Google Scholar]
  • 15.Peng S. Monotonic limit theorem of BSDE and nonlinear decomposition theorem of Doob- Meyer’s type. Prob. Theory Relat. Fields. 1999;113:473–499. doi: 10.1007/s004400050214. [DOI] [Google Scholar]
  • 16.Peng S, Xu M. The smallest g-supermartingale and reflected BSDE with single and double Inline graphic-obstacles. Ann. Inst. H. Poincaré Probab. Stat. 2005;41:605–630. doi: 10.1016/j.anihpb.2004.12.002. [DOI] [Google Scholar]
  • 17.Xu Y. An existence theorem for multidimensional BSDEs with mixed reflections. C. R. Acad. Sci. Paris Ser. I. 2016;354:1101–1108. doi: 10.1016/j.crma.2016.09.015. [DOI] [Google Scholar]

Articles from Computational Science – ICCS 2020 are provided here courtesy of Nature Publishing Group

RESOURCES