Skip to main content
Springer Nature - PMC COVID-19 Collection logoLink to Springer Nature - PMC COVID-19 Collection
. 2022 Dec 9:1–18. Online ahead of print. doi: 10.1007/s10100-022-00834-0

Distorted probability operator for dynamic portfolio optimization in times of socio-economic crisis

Kerem Uğurlu 1, Tomasz Brzeczek 2,
PMCID: PMC9734642  PMID: 36531521

Abstract

A robust optimal control of discrete time Markov chains with finite terminal T and bounded costs or wealth using probability distortion is studied. The time inconsistency of these distortion operators and hence its lack of dynamic programming are discussed. Due to that, dynamic versions of these operators are introduced, and its availability for dynamic programming is demonstrated. Based on dynamic programming algorithm, existence of the optimal policy is justified and an application of the theory to portfolio optimization along with a numerical study is also presented.

Keywords: Probability distortion, Markov decision processes, Dynamic programming, Risk management, Mathematical finance

Introduction

Starting with political and economical crisis in 1990’s and recent global Covid-19 pandemic have caused unstable market periods. Most recently, in the global pandemic, stock prices has witnessed sharp drops and peaks (Batabyal and Killinis 2021). This turmoil event is called a black swan. They are said to be unpredictable with mathematical models as being not reflected in historical data (Phillips 2019; Werther 2017). However, for sure monthly expected rate of return for any financial investment in stock is overestimated for a period of data given turbulence will occur (Focard and Fabozzi 2009). Good market returns are biased with overestimation of the probability of positive extremely high returns. To overcome this, using distortion operators is a well known technique to mitigate optimistic expectations. It is used frequently in behavioural finance (see e.g. Kahneman and Tversky 1979, Kahneman and Tversky 1992, Zhou 2010). It has been motivated by empirical studies in behavioural finance and aims to model the human tendency to exaggerate small probabilities of extreme events (Wakker 2010). In particular, it is only natural to consider distortion operators to estimate the risk during global crisis such as the recent pandemic period. One can hinder the error of naively predicting the future returns with a current state of the market that is changing all the time. The distortion operator is shown to be robust to optimistic high returns. Namely, it is more sensitive to the risk of negative returns than the expectation operator by mitigating the chance of positive returns. In particular, the distortion operator is risk-averse. It has a lot in common with value investment strategies that are shown to outperform market return-risk efficiency even in long term. This is to be observed since economic turmoil in 2008 (see Elze 2012, Majewski et al. 2020).

In that respect, models with risk aversion has a long history, and they are represented via alternative approaches. One of these approaches is using concave utility functions modelling risk-aversion (see e.g. Chung and Sobel 1987, Fleming and Sheu 1999, Fleming and Sheu 2000, Jaquette 1973, Jaquette 1976) and the references therein), where the utility functions are subject to satisfy some regularity properties. Another approach uses the so-called coherent risk measures introduced in Artzner et al. (1999). Here, these risk measures are again subject to satisfy some axioms modelling the random outcomes taking risk awareness into consideration. We refer the reader to Artzner et al. (2007); Ruszczynski (2010); Cheridito et al. (2006); Eichhorn and Romisch (2005); Follmer and Penner (2006); Fritelli et al. (2002, 2005)) and the references therein for further details on the risk measures.

On the other hand, although modelling random outcomes representing gains/losses using probability distortion goes back to at least 1970’s (Kahneman and Tversky 1979), its axiomatic incorporation into multiperiod settings is still absent in the literature. There are few recent works in this direction. To mention few, (He and Zhou 2011) studies a portfolio optimization problem in continuous time using probability distortion, whereas (Kun et al. 2018) studies a discrete time controlled Markov chain in infinite horizon. In another work, (Ma et al. yyy) assumes monotonicity of the cost/gain functions and presents the results under that assumption. The reason for scarcity of the literature in multiperiod setting lies in the fact that the distortion operator is of limited use in control problems due to not satisfying “Dynamic Programming Principle” (DPP) or “Bellman Optimality Principle”. Namely, a sequence of optimization problems with the corresponding optimal controls is called time-consistent, if the optimal strategies obtained when solving the optimal control problem at time s stays optimal when the optimal control problem (OCP) is solved at time t>s (Bjork et al. 2017). OCP’s are of vital importance in various fields of operations research In this paper, we introduce a dynamic version of probability distortion that does not suffer from time-inconsistency. DPP can be applied readily in our framework under controlled Markov chains, and additionally DPP gives the existence of the optimal policy.

The rest of the paper is organized as follows. In Sect. 2, we describe probability distortion on random variables in a static one-period case first. Next, we introduce the concept of dynamic probability distortion on stochastic processes in a multi-temporal discrete time setting. In Sect. 3, we introduce the controlled Markov chain framework that we are going to work on. In Sect. 4, we state and solve our optimal control under study, by characterizing both the optimal value and policies as solutions of the dynamic programming equations. In Sect. 5, we illustrate our results on a portfolio optimization problem and conclude the paper.

Probability distortion

In this section, the concept of probability distortion along with the corresponding operator and its properties are introduced. These definitions are further extended to the multi-temporal/dynamic setting.

Probability distortion on random variables

Let (Ω,F,P) be a probability space and denote by L+(Ω,F,P) the set of non-negative essentially bounded random variables on (Ω,F).

Definition 2.1

  • A mapping w:[0,1][0,1] is called a distortion function, if it is continuous, strictly increasing, and satisfies w(0)=0 and w(1)=1.

  • For any ξL+(Ω,F,P), the operator with respect to the distortion function w is defined by
    ρ(ξ)0wP(ξz)dz 2.1

Lemma 2.1

  • (i)
    Let x,y,α[0,1], ξL+(Ω,F,P) and w:[0,1][0,1] be a distortion function that satisfies
    w(αx+(1-α)y)αw(x)+(1-α)w(y). 2.2
    Then, ρ(ξ)E[ξ]. Namely, for ξ representing the nonnegative bounded random losses, ρ(·) evaluates a bigger risk for ξ than E[·] does.
  • (ii)
    Conversely, suppose w satisfies for α[0,1]
    w(αx+(1-α)y)αw(x)+(1-α)w(y), 2.3
    then ρ(ξ)E[ξ]. Namely, for ξ representing the nonnegative bounded random gains, ρ(·) evaluates a smaller gain for ξ than E[·] does.

Proof

We will only prove the first part. By w(0)=0 and (2.2), we have w(αx)αw(x) for any α[0,1]. In particular, for x=1, we get w(α)α for any α[0,1]. Thus, w(P(ξz))P(ξz) for any zR. By taking integrals on both sides, we conclude the result.

Remark 2.1

Lemma 2.1 implies that (2.2), respectively (2.3), is an appropriate property of the distortion function w for modelling risk averse behaviour towards random costs, respectively towards random profits.

Lemma 2.2

Let ρ:L+(Ω,F,P)R be the distortion operator as in (2.1). Then

  • (i)

    ρ is positively translation invariant, i.e., ρ(ξ+c)=ρ(ξ)+c for c0. In particular, ρ(c)=c for any c0.

  • (ii)

    ρ is positively homogeneous, i.e. ρ(λξ)=λρ(ξ) for λ0.

  • (iii)

    ρ is monotone, i.e. ρ(ξ1)ρ(ξ2) for ξ1,ξ2L+(Ω,F,P) and ξ1ξ2.

Proof

  • (i)
    ρ(ξ+c)=0wP(ξ+cz)dz=0w(P(ξz-c))dz=-c0wP(ξz)dz+0wP(ξz)dz=c+ρ(ξ)
    Moreover, we have
    ρ(0)=0w(P(0z))dz={0}w(P(0z))dz={0}w(1)dz=0
    Hence, by the first equality above, we have ρ(0+c)=c for c0.
  • (ii)
    ρ(λξ)=0w(P(λξz))dz=λ0wPξzλdzλ=λρ(ξ)
  • (iii)
    Since ξ1ξ2 and w is monotone, we have for any z0
    P(ξ1z)P(ξ2z)w(P(ξ1z))w(P(ξ2z))
    Thus, we have ρ(ξ1)ρ(ξ2).

Dynamic probability distortion on stochastic processes

The main issue occurs when one tries to extend (2.1) to the multi-period setting. In particular, it is not clear what the “conditional version" of distortion operator is. Hence, first the corresponding operator for multi-temporal dynamic setting is constructed.

Fix TN0 and denote T[0,1,,T] and T~[0,1,,T-1]. Let Ω be the sample space with its respective sigma algebra denoted by F. Let F0F1FTF be a the filtration, and P being the probability measure on Ω such that (Ω,F,(Ft)tT,P) is the stochastic basis. Let ξ=(ξt)tT be a discrete time non-negative stochastic process that is adapted to the filtration (Ft)tT and uniformly bounded that is suptTesssup(ξt)<. We denote in that case ξL+(Ω,(Ft)tT,P). Then, if we define for tT

ρt(ξT)0wP(ξTz|Ft)dz,

we do not necessarily have

ρ(ξ)=ρ(ρt(ξ))

In particular, the “tower property” of expectation operator fails in distortion operators (see Example 2.1 below.). In the context of stochastic optimization, this implies that the optimization problem becomes “time-inconsistent”, i.e. the “Dynamic Programming Principle” (DPP) does not hold. On the other hand, for w(x)=x, the distortion operator (2.1) reduces to expectation operator, whereas for Et[ξT]E[ξT|Ft], we have E[ξT]=E[Et[ξT]] with the towering property, and DPP holds.

Analogous to Definition 2.1, we define first dynamic distortion mappings on a filtered probability space (Ω,F,(Ft)tT,P) in a multitemporal setting as follows.

Definition 2.2

Let tT~ and ξt+1L+(Ω,Ft+1,P). Also consider the distortion function w(·) as in Definition 2.1.

  • A one-step dynamic distortion mapping ϱt+1|t:L+(Ω,Ft+1,P)L+(Ω,Ft,P) is defined as
    ϱt+1|t(ξt+1)0wP(ξt+1zt+1|Ft)dzt+1
  • A mapping ϱt:L+(Ω,FT,P)L+(Ω,Ft,P) is called a dynamic distortion mapping, if it is composition of one step dynamic distortion mappings of the form
    ϱtϱt+1|tϱT|T-1

Remark 2.2

Definition 2.2 is well defined. Indeed, let ξTL+(Ω,FT,P), going backwards iteratively, by properties of w and construction of ϱt, uniform boundedness and Fs measurability at each s[t,,T] are preserved, such that ϱt(ξT) maps ξT to L+(Ω,Ft,P). Furthermore, by construction ϱs(·)=ϱs(ϱt(·)) for 0stT. In particular, it is a time-consistent operator.

Lemma 2.3

For tT, let ϱt:L+(Ω,FT,P)L+(Ω,Ft,P) be the dynamic distortion operator as in Definition 2.2 and ξ,ξ1,ξ2L+(Ω,FT,P). Then

  • (i)

    ϱt is positively translation invariant, i.e., ϱt(ξ+c)=ϱt(ξ)+c P-a.s., if c is nonnegative and Ft measurable.

  • (ii)

    ϱt is positively homogeneous, i.e. ϱt(λξ)=λϱt(ξ) P-a.s. for any scalar λ0.

  • (iii)

    ϱt is monotone, i.e. ϱt(ξ1)ϱt(ξ2) P-a.s. for ξ1ξ2, P-a.s..

Proof

The proof is a simple modification of Lemma 2.2.

Next, we illustrate the failure of towering property that causes time inconsistency via the following example.

Example 2.1

Let X and Y be two i.i.d. random variables on some probability space (Ω,F,P) with P(X=1)=P(X=2)=12, P(Y=1)=P(Y=2)=12 and w(x)=x1/2. Let ξ1=X and ξ2=X+Y, with F1=σ(X) and F2=σ(X,Y). Then

ρ2|1(ξ2)=X+ρ1|0(Y)=X+w(1)+w12,

where we use Lemma 2.3 i) in the first equality, above. Similarly, we have

ρ1|0ρ2|1(ξ2)=ρ(X)+w(1)+w12=2w(1)+2w12=2+2121/2.

On the other hand, we have

ρ(ξ2)=0w(P(ξ2z))dz=[0,2]w(P(ξ2z))dz+(2,3]w(P(ξ2z))dz+(3,4]w(P(ξ2z))dz=2w(1)+(2,3]w(3/4)dz+(3,4]w(1/4)dz=2+w(3/4)+w(1/4)=2+341/2+141/2

Hence, ρ1|0ρ2|1(ξ2)>ρ(ξ2) by strict concavity of w. We further note that the two expressions would be equal to each other, if w(x)=x.

Controlled markov chain framework

In this section, we are going to introduce the necessary background on discrete-time controlled Markov processes (a.k.a. Markov decision processes (MDPs) (see e.g. Hernandez-Lerma and Lasserre 1996) that we are going to work, but using now the dynamic probability distortion framework.

We take the control model

Mt:=(Xt,At,Kt,Qt,F,rt)

with the following components:

  • Xt and At denote the state and action (or control) space, respectively, which are assumed to be Borel spaces, that is, Borel subsets of complete and separable metric spaces with their corresponding Borel σ-algebras B(Xt) and B(At).

  • For each xXt, let At(x)At be the set of all admissible controls in the state x. We assume that At(x) is compact for tT and denote
    Kt:=(x,a):xXt,aAt(x) 3.1
    as the set of feasible state-action pairs.
  • We define the system function as
    xt+1Ft(xt,at,ηt) 3.2
    for all tT~ with xtXt and atAt, and i.i.d. random variables (ηt)tT~ on a probability space (Y,B(Y),Pη) with values in Y that are complete separable Borel spaces. We assume that the mapping (s,x,a)F(s,x,a,y) in (3.2) is continuous on St×Xt×At for every yY at every tT~.
  • Let
    Ωt=0TXt
    and for tT, and
    Ft=σX0,A0,,Xt-1,At-1,Xt
    be the filtration of increasing σ-algebras.
  • Let Ft be the family of measurable functions and πtFt with πt:XtAt for tT~. A sequence (πt)tT~ of functions πtFt is called an admissible control policy (or simply a policy), and the function πt(·) is called the decision rule or control at time t. We denote by Π the set of all admissible control policies.

  • Let rt(xt,at):Xt×AtR+ for tT~ and rT:XTR+ be the non-negative real-valued reward-per-stage and terminal reward function, respectively. For (πt)tT~Π, we write
    rt(xt,πt)rt(xt,πt(xt))rt(xt,at).
  • Let πΠ and x0X0 be given. Then, there exists a unique probability measure Pπ on (Ω,F) such that, given xXt, a measurable set Bt+1Xt+1 and (xt,at)Kt, for any tT~, we have
    Qt+1(Bt+1|xt,at)Pt+1π(xt+1Bt+1|xt,at,,x0).
    Here, Qt+1(Bt+1|xt,at) is the stochastic kernel (see e.g. Hernandez-Lerma and Lasserre 1996). Namely, for each pair (xt,at)Kt, Qt+1(·|xt,at) is a probability measure on Xt+1, and for each Bt+1Bt+1(Xt+1), Qt+1(Bt+1|·,·) is a measurable function on Kt. We remark that at each tT, the stochastic kernel depends only on (xt,at) rather than the whole history (x0,a0,x1,a1,,at,xt). By (3.2), we have
    Qt+1(Bt+1|xt,at)=YIBt+1[F(xt,at,y)]dPη(y),Bt+1B(Xt+1),
    where IBt+1 denotes the indicator function of Bt+1.

Assumption 3.1

  • The reward functions rt(xt,at) for tT~ and rT(xT) are nonnegative, continuous in their arguments and uniformly bounded i.e. 0rt(xt,at)< and 0rT(xT)<.

  • The multi-function (also known as a correspondence or point-to-set function) xAt(x) is upper semi-continuous (u.s.c.). That is, if {xm}Xt and {am}At(xm) are sequences such that xmx¯, and ama¯, then a¯At(x¯) for tT~.

  • For every state xXt, the admissible action set At(x) is compact for tT~.

Optimal control problem

Main Result

For every tT~, xtXt and πΠ, let

Vt(xt,π)ϱti=tT-1ri(xi,πi)+rT(xT)

be the performance evaluation from time tT~ onwards using the policy πΠ given the initial condition xXt. The corresponding optimal (i.e. maximal) value is then

Vt(xt)supπΠVt(xt,π) 4.1

A control policy π=(πt)tT~ is said to be optimal if it attains the maximum in (4.1), that is

Vt(x)=Vt(x,π)for allxXtand fortT~. 4.2

Thus, the optimal control problem is to find an optimal policy and the associated optimal value (4.2) for all tT. We now present the main result of the paper.

Theorem 4.1

The optimization problem (4.1) obeys dynamic programming principle and has an optimal policy πΠ. Furthermore, Vt(xt) is continuous in its argument.

Proof of Theorem 4.1

To prove Theorem 4.1, we need the following key lemma.

Lemma 4.1

Let K be defined as in (3.1). Let V:KR be a nonnegative continuous function. For xtXt, define

V(xt)supaAV(xt,a).

Then, for any xtXt, there exists a B(Xt) measurable mapping πt:XA such that

V(xt)=V(xt,πt(xt)) 4.3

and V:XtR is continuous.

Proof

By Lemma 4.1 in Rieder (1978), there exists B(Xt) measurable mapping π:XtAt such that (4.3) holds and V(xt) is upper semi-continuous. But, since V(·,·) is continuous, supaAV(xt,a) is lower semi-continuous in x, as well. Hence, V(·,·) is continuous in its arguments.

Lemma 4.2

Suppose Assumption 3.1 holds true. Then, supremum is attained at (4.1) for some B(Xt) measurable mapping πt(xt)=at for tT~. Furthermore, each Vt is continuous.

Proof

We will show only the case for t=T-1. The others follow going backwards iterative down to t=0. We first show that

(xT-1,aT-1)0wPπ(rT(F(sT-1,xT-1,aT-1,ηT-1))zTdzT

is continuous in its arguments. Let (xT-1m,aT-1m)(xT-1,aT-1) as m. Then, we have

limmVT-1(xT-1m,aT-1m)=limm0wPπ(rT(F(xT-1m,aT-1m,ηT-1))zTdzT=0limmwPπ(rT(F(xT-1m,aT-1m,ηT-1))zTdzT=0wlimmPπ(rT(F(xT-1m,aT-1m,ηT-1))zTdzT=0wPπ(limmrT(F(xT-1m,aT-1m,ηT-1))zTdzT=0wPπ(rT(F(xT-1,aT-1,ηT-1))zTdzT

The second equality follows by boundedness of rT(), w(·) and Lebesgue dominated convergence theorem. The third equality follows by continuity of w(·), the fourth equality follows by continuity of probability measure, and the fifth equality follows by continuity of transition F(·,·,·) as in (3.2). Hence, VT-1(·,·) is continuous in its arguments. The result follows by Lemma 4.1.

Now, we are ready to prove Theorem 4.1.

Proof of Theorem 4.1

We have

VT-1(xT-1)=supaT-1AT-1(xT-1)0wPπ(rT(F(xT-1,aT-1),ηT-1))zTdzT=0wPπ(rT(F(xT-1,πT-1(sT-1,xT-1),ηT-1))zTdzT.

By Lemma (4.2), there exists a B(XT-1) measurable mapping πT-1FT-1 such that πT-1(xT-1)=aT-1, and VT-1(xT-1) is continuous. Hence, using Lemma 2.2(i) for t=T-2, we have

VT-2(xT-2)=supaT-2AT-2(xT-2)aT-1AT-1(xT-1)0w(Pπ(rT-2(xT-2,aT-2)+VT-1(F(xT-2,aT-2,ηT-2))zT-1)dzT-1

By Lemma (4.2) again, it admits an optimal policy aT-2AT-2 such that

VT-2(xT-2)=0w(Pπ(rT-2(xT-2,aT-2)+VT-1(F(xT-2,aT-2,ηT-2))zT-1)dzT-1

Going backwards iterative, we conclude that dynamic programming holds, (4.1) admits an optimal policy πΠ attaining supremum that depends only on st and on xt at each tT~. Furthermore, Vt(·) is continuous again by Lemma (4.2). Hence, we conclude the proof.

Based on our main result, the methodology is as follows. Given the distortion operator along with the controlled Markov process, one checks whether the framework with reward and control sets satisfy the requirements in 3.1, Theorem 4.1 reveals that the dynamic programming can be applied to find the optimal controls along with the optimal value function. The next section exemplifies this.

An application to portfolio optimization

Model

Suppose an investor has a portfolio of n stocks. The prices of n stocks at tT are denoted by

St(St1,,Stn).

The price of stock i[1,2,,,n] at time tT~, denoted by Sti, has dynamics

St+1i=(1+ri)Stiwith probabilitypi, 5.1

where -1<ri<1 is the proportional return rate of price of ith stock Sti. Let Pη(·) denote the joint probability mass function of St for tT. Let π=(πt)tT be the policy of the investor that stands for the number of shares of n stocks investor is holding at time tT~ with

πt:StRn,

where πt is B(St) measurable. We assume that the investor has a capacity to be in the long or short position. Namely, we take that πt(x)C for some C>0, for all xSt and tT~. We denote by Π the admissible strategies (πt)tT~ that are B(St) measurable and uniformly bounded by C. We take that the market is self-financing in the sense

Yt+1=πtSt+1fortT~,

with Yt+1 being the value of the portfolio and St+1 being the n-dimensional vector as defined in (5.1) at time t+1 such that denoting x-1x0,

ΔYtYt-yt-1,

is the difference of the total wealth between time t and t-1 for tT. Hence, the reward function at tT reads as

rt(st-1,st,πt)=ΔYtrT(sT-1,sT)=ΔYTYt=yt-1+rt(st-1,st,πt),

Let w(x)=x2 for x[0,1] be the distortion of the probability function such that for a fixed πT-1 given YT-1=yT-1 and ST-1=sT-1, the performance measure is defined by

ϱT-1(YT)0(Pπ(yT-1+πT-1(ST-sT-1)zT|yT-1,sT-1))2dzT=yT-1+0(Pπ(πT-1(ST-sT-1)zT|yT-1,sT-1))2dzT=VT-1(yT-1,sT-1,π)

such that

VT-1(yT-1,sT-1)=maxπΠVT-1(yT-1,sT-1,π).

Here, in the second equality Lemma 2.3 is used. Hence, going backwards iterative, we have at each time tT~

Vt(yt,st,π)=yt+0(Pπ(Vt+1(Yt+1,St+1,π)zt+1|yt,st))2dzt+1Vt(yt,st)=maxπΠVt(yt,st,π). 5.2

The methodology is that the application satisfies Theorem 4.1. Indeed, it is immediate to see that the conditions for Assumption 3.1 are satisfied for the reward function and the action sets. Thus, Theorem 4.1 can be applied. In particular, Theorem 4.1 allows the dynamic programming yielding an optimal strategy (πt)tT~Π attaining (5.2) along with the optimal value Vt at each time tT~.

Numerical example

Consider discrete time set T={0,1,2} and two stocks Stock A and Stock B. The prices of Stock A and Stock B at tT are denoted by StA and StB respectively. Prices at t=0 are denoted by S0A=S0B=1. Additionally, suppose that an investor can buy one of Stock A, Stock B or portfolio Stock AB with equal shares of both stocks. His initial wealth to be invested equals 1. An investor can switch between Stock A, Stock B, or trade-off between stocks to share equally current wealth into both stocks at each time t=0,1,2. The current state of wealth changes as stock price goes up or down with movement rate denoted by rA and rB, respectively. They are independent random variables satisfying

P(rA=0.22)=P(rA=-0.20)=12P(rB=0.12)=P(rB=-0.10)=12.

In particular, the expected value of return for the given share is positive E[rA]=E[rB]=E[0.5rA+0.5rB]=0.01. Hence, 2-period investment, in the same stock, as well as investing in equal shares portfolio are expected to give return of 1.012-1=0.0201. The distortion function w(x)=x2 on x[0,1]. Hence, w(P(rA=0.22))=(12)2=14 and w(P(rA=-0.20))=1-(12)2=34. The highest return using the distortion operator at t=0 equals

ϱ1|0B=0.912>ϱ1|0AB=0,902>ϱ1|0A=0.864. 5.3

Here ϱ1|0A denotes the value if the investor starts with putting all his wealth into A. ϱ1|0B and ϱ1|0AB denote accordingly. By (5.3), optimal strategy is to invest in Stock B for t=1 and continuing this investment for t=2. It is depicted in Fig. 2, below. However, return estimated with dynamic probability distortion is 0.912-1=-0.088. In particular, it is negative.

Fig. 2.

Fig. 2

Starting with Investing in Stock B

Moreover, Fig. 1 shows that if one starts with investing in Stock A at t=0, then the optimal decision is to switch to Stock B at t=1. In this case the dynamic operator gives value ϱ0B=0.864, and return at t=2 is 0.864-1=-0.136. Similarly, we see at Fig. 3 that if one starts with investing equal shares into Stock A and Stock B at t=0, then the investor should switch to Stock B, and the distortion operator gives ϱ0AB=0.902. The results at Figs. 1, 2 and 3 reveal that the distortion operator prevents an investor from taking risk by investing in Stock A even though the expected rate of return is equal in any period of time. The investor chooses Stock B only irrelevant of his first stake at t=0. Furthermore, the strategy is time consistent. The Figs. 1, 2 and 3 summarize the corresponding actions, where the bold fonts at each time epoch denote the optimal actions.

Fig. 1.

Fig. 1

Starting with Investing in Stock A

Fig. 3.

Fig. 3

Starting with Investing in Stock AB

Conclusion and future work

This paper discusses assessing multi-period risk of an investment using distortion operators. The peculiarity of these operators lies in the fact that they give optimum controls that are not time consistent in a multi-period framework. The dynamic distortion operator introduced in this paper is the way of multi-period aggregation of the distortion operator that satisfies time consistency and hence dynamic programming principle. Furthermore, it is demonstrated how these operators work and apply to the investment problem. The main economic implication of the presented methodology is as follows. If observed probabilities are distorted but observed outcomes of stock return rate are viable, then the dynamic distortion operators produce optimum multi-period investment strategy that is robust to risk and is return effective.

Further research will be to focus on empirical results of investment strategies based on distortion operators. These results should be compared with alternative strategies using the same set of empirical data. For instance, the proposed framework can be compared with the strategies presented in Elze (2012); Majewski et al. (2020), which outperforms market return-risk efficiency. A scope of downside risk measures and models that are alternatives to the presented investing optimization methodology were proposed and applied by Barro and Canestrelli (2014). Also using second order stochastic dominance (SSD) relations (Batabyal and Killinis 2021) and convex risk measures are alternatives (Ruszczynski 2010; Follmer and Penner 2006; Fritelli et al. 2002) to the proposed methodology in this work, whose performance on empirical data is to be compared.

Declarations

Conflict of interest

Kerem Uğurlu is the first author of the manuscript. Kerem Uğurlu has been financially supported by Nazarbayev University under the Project SSH2020016 “Robust Methods in Financial Mathematics and Stochastic Control” during the preparation of this manuscript. There is no conflict of interest between the authors of this manuscript.

Footnotes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Kerem Uğurlu, Email: kerem.ugurlu@nu.edu.kz.

Tomasz Brzeczek, Email: tomasz.brzeczek@put.poznan.pl.

References

  1. Artzner P, Delbaen F, Eber JM, Heath D. Coherent measures of risk. Math Financ. 1999;9:203–228. doi: 10.1111/1467-9965.00068. [DOI] [Google Scholar]
  2. Artzner P, Delbaen F, Eber JM, Heath D, Ku H. Coherent multiperiod risk adjusted values and Bellmans principle. Ann Oper Res. 2007;152:5–22. doi: 10.1007/s10479-006-0132-6. [DOI] [Google Scholar]
  3. Barro D, Canestrelli E. Downside risk in multiperiod tracking error models. Cent Eur J Oper Res. 2014;22(2):263–283. doi: 10.1007/s10100-013-0290-y. [DOI] [Google Scholar]
  4. Batabyal S, Killinis R. Economic policy uncertainty and stock market returns: evidence from Canada. J Econ Asymmetr. 2021;24(e00215):1–14. [Google Scholar]
  5. Bellman R. On the theory of dynamic programming. Proc Natl Acad Sci. 1952;38:716. doi: 10.1073/pnas.38.8.716. [DOI] [PMC free article] [PubMed] [Google Scholar]
  6. Bjork T, Khapko M, Murgoci A. On time-inconsistent stochastic control in continuous time. Financ Stoch. 2017;21:331–360. doi: 10.1007/s00780-017-0327-5. [DOI] [Google Scholar]
  7. Branda M, Kopa M. On relations between DEA-risk models and stochastic dominance efficiency tests. Cent Eur J Oper Res. 2014;22(1):13–35. doi: 10.1007/s10100-012-0283-2. [DOI] [Google Scholar]
  8. Cheridito P, Delbaen F, Kupper M. Dynamic monetary risk measures for bounded discrete-time processes. Electron J Probab. 2006;11:57–106. doi: 10.1214/EJP.v11-302. [DOI] [Google Scholar]
  9. Chung K, Sobel MJ. Discounted MDP’s: distribution functions and exponential utility maximization. SIAM J Control Optim. 1987;25:49–62. doi: 10.1137/0325004. [DOI] [Google Scholar]
  10. Eichhorn A, Romisch W. Polyhedral risk measures in stochastic programming. SIAM J Optim. 2005;16:69–95. doi: 10.1137/040605217. [DOI] [Google Scholar]
  11. Elze G. Value investors anomaly: return enhancement by portfolio replication - an empiric portfolio strategic analysis. Cent Eur J Oper Res. 2012;20(4):633–647. doi: 10.1007/s10100-011-0214-7. [DOI] [Google Scholar]
  12. Fleming WH, Sheu SJ. Optimal long term growth rate of expected utility of wealth. Ann Appl Probab. 1999;9:871–903. doi: 10.1214/aoap/1029962817. [DOI] [Google Scholar]
  13. Fleming WH, Sheu SJ. Risk-sensitive control and an optimal investment model. Math Financ. 2000;10:197–213. doi: 10.1111/1467-9965.00089. [DOI] [Google Scholar]
  14. Focard S, Fabozzi FJ. Black swans and white eagles: on mathematics and finance. Math Meth Oper Res. 2009;69(3):379–394. doi: 10.1007/s00186-008-0243-8. [DOI] [Google Scholar]
  15. Follmer H, Penner I. Convex risk measures and the dynamics of their penalty functions. Stat Decis. 2006;24:61–96. [Google Scholar]
  16. Fritelli M, Rosazza Gianin E. Putting order in risk measures. J Bank Financ. 2002;26:1473–1486. doi: 10.1016/S0378-4266(02)00270-4. [DOI] [Google Scholar]
  17. Frittelli M, Gianin E Rosazza (2005) Dynamic convex risk measures (2005). Risk measures for the 21st century. Wiley, Chichester, pp. 227-248
  18. He XD, Zhou XY. Portfolio choice via quantiles. Math Financ. 2011;21(2):203–231. [Google Scholar]
  19. Hernandez-Lerma O. Adaptive Markov control processes. New York: Springer-Verlag; 1989. [Google Scholar]
  20. Hernandez-Lerma O, Lasserre JB (1996) Discrete-time Markov control processes. In: Basic optimality criteria. Springer, New York. 10.1007/978-1-4612-0729-0
  21. Jaquette SC. Markov decision processes with a new optimality criterion: discrete time (1976) Ann Stat. 1973;1:496–505. doi: 10.1214/aos/1176342415. [DOI] [Google Scholar]
  22. Jaquette SC. Utility criterion for Markov decision processes. Manag Sci. 1976;23:43–49. doi: 10.1287/mnsc.23.1.43. [DOI] [Google Scholar]
  23. Kahneman D, Tversky A. Prospect theory: an analysis of decision under risk. Econometrica. 1979;47:263–292. doi: 10.2307/1914185. [DOI] [Google Scholar]
  24. Kahneman D, Tversky A. Advances in prospect theory: cumulative representation of uncertainty. J Risk Uncertain. 1992;5:297–323. doi: 10.1007/BF00122574. [DOI] [Google Scholar]
  25. Kara G, Ozmen A, Weber GW. Stability advances in robust portfolio optimization under parallel piped uncertainty. Cent Eur J Oper Res. 2019;27:241–261. doi: 10.1007/s10100-017-0508-5. [DOI] [Google Scholar]
  26. Kun L, Cheng J, Marcus SI. Probabilistically distorted risk-sensitive infinite-horizon dynamic programming. Automatica. 2018;97:1–6. doi: 10.1016/j.automatica.2018.07.028. [DOI] [Google Scholar]
  27. Kurum E, Kasirga Y, Weber GW. A classification problem of credit risk rating investigated and solved by optimisation of the ROC curve. Cent Eur J Oper Res. 2012;20(3):529–557. doi: 10.1007/s10100-011-0224-5. [DOI] [Google Scholar]
  28. Majewski S, Tarczynski W, Tarczynska-Luniewska M. Measuring investors’ emotions using econometric models of trading volume of stock exchange indexes. Invest Manag Financ Innov. 2020;17(3):281–291. [Google Scholar]
  29. Ma J, Wong T, Zhang J Time-consistent conditional expectation under probability distortion, preprint
  30. Phillips E. Nassim Taleb heads international banking’s first Grey/Black Swan committee. Q Rev Econ Financ. 2019;72:117–122. doi: 10.1016/j.qref.2018.11.005. [DOI] [Google Scholar]
  31. Rieder U. Measurable selection theorems for optimisation problems. Manuscr Math. 1978;24:115–131. doi: 10.1007/BF01168566. [DOI] [Google Scholar]
  32. Ruszczynski A. Risk-averse dynamic programming for Markov decision processes. Math Program B. 2010;125(2010):235–261. doi: 10.1007/s10107-010-0393-3. [DOI] [Google Scholar]
  33. Wakker P. Prospect theory: for risk and ambiguity. Cambridge: Cambridge University Press; 2010. [Google Scholar]
  34. Werther GFA. Improving finance and risk management foresight abilities: Growing past the black swan mindset through integrative assessment. J Risk Manag Financ Institut. 2017;10(4):353–364. [Google Scholar]
  35. Zhou X (2010) Mathematicalising Behavioural Finance, (2010). Proceedings of the international congress of mathematicians Hyderabad, India

Articles from Central European Journal of Operations Research are provided here courtesy of Nature Publishing Group

RESOURCES