Next Article in Journal
A Novel, Energy-Aware Task Duplication-Based Scheduling Algorithm of Parallel Tasks on Clusters
Previous Article in Journal
Reliable Network Interdiction Models with Multiple Unit Costs
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimization of Setting Take-Profit Levels for Derivative Trading

1
College of Economics and Management, Nanjing Forestry University, Nanjing 210037, China
2
School of Finance and Economics, Jiangsu University, Zhenjiang 212013, China
3
School of Business, Jinling Institute of Technology, Nanjing 211169, China
4
School of Finance, Nanjing Audit University, Nanjing 211815, China
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Math. Comput. Appl. 2017, 22(1), 1; https://doi.org/10.3390/mca22010001
Submission received: 11 September 2016 / Revised: 29 November 2016 / Accepted: 9 December 2016 / Published: 22 December 2016

Abstract

:
This paper develops an optimal stopping rule by characterizing the take-profit level. The optimization problem is modeled by geometric Brownian motion with two switchable regimes and solved by stochastic calculation. A closed-form profitability function for the trading strategies is given, and based on which the optimal take-profit level is numerically achievable with small cost of computational complexity.

1. Introduction

Derivative trading has been reshaped by quantitative techniques in recent decades [1]. This paper aims to solve the optimization problem of setting take-profit levels to maximize the profitability. Considerable studies on closing a deal are implemented into trading practice. Eloe et al. [2] optimized the threshold levels of taking profit and stopping loss based on a regime-switching model. On the other hand, modeling with regime-switching has the advantage of flexibility in changing parameters. Since first introduced by [3], intensive research interests have been drawn to this area, for example the research by Yao et al. [4] on pricing the European option by a regime-switching model.
In this paper, we also apply switched regimes, but not driven by another independent process or external factors. To optimize the take-profit level, regime-switching in our model is triggered by the price process itself; hence, our model is less subject to parameter estimation and prediction, and performs more neutrally to unveil the variation brought by the take-profit level.
We proceed as follows. In Section 2, we formulate the optimal selling problem. Section 3 gives the probability distribution of the transaction time. In Section 4, the profitability function is explicitly expressed in closed-form and optimal take-profit level is achievable from this expression. Section 5 proceeds the numerical simulation to show that the results obtained by our method are consistent with those by crude Monte Carlo simulation [5] , but ours consume less time.

2. Problem Formulation

Suppose a pair of opposite trades are opened by the the current ask price x + and bid price x at time t, the price X t is recognized as x + + x 2 and denoted as x. Thereby, the cost for a pair of orders are x + x , assumed as a constant θ < X 0 . Let x ( 1 + η ) be the closing price for long trades, and x ( 1 η ) for short trades, x η is the profit gained in each single deal, where η ( 0 , 1 ) as the take-profit rate. The price dynamic is simulated by the process { X t : t [ 0 , ) } formulated by the following equation:
d X t = μ ( μ σ 2 2 ) 1 { X ^ 0 , t X 0 ( 1 + η ) or X ˇ 0 , t X 0 ( 1 η ) } X t d t + σ X t d W t
where μ I R , σ > 0 , X 0 > 0 , and X ^ s 1 , s 2 : = sup s 1 r s 2 X r , X ˇ s 1 , s 2 : = inf s 1 r s 2 X r . The nature filtration ( F t ) t I R + is generated by a Wiener process ( W t ) t I R + . For any T > 0 , consider the process { X t : t [ 0 , T ] } ; to make it under a risk-neutral setting, a new probability measure P ^ is defined by
d P ^ = exp 0 T φ t d W t 0 T 1 2 φ t 2 d t d P ,
where the process φ t is given by
φ t : = μ ( μ σ 2 2 ) 1 { X ^ 0 , t X 0 ( 1 + η ) or X ˇ 0 , t X 0 ( 1 η ) } , t [ 0 , T ] ,
hence under this measure, P ^ , W t 0 t φ u d u is a standard Brownian motion and X t is also a martingale. Without loss of generality and for convenience of notation, we still proceed under the original measure P instead of P ^ for the remaining part. For any t I R + , in the event that X 0 ( 1 η ) < X s < X 0 ( 1 + η ) for all s [ 0 , t ] , ( X s ) s [ 0 , t ] follows a geometry Brownian motion as in the Black–Scholes model. The drift factor μ is set according to the predicted trend based on the previous information. Therefore, once the threshold level is achieved, we abandon the previously obtained value of the drift factor μ, and make no more prediction for the uncertainty; rather, the price thereafter is simulated by a martingale—namely, letting the drift factor vanish. According to our stopping rule, two stopping times are defined as follows,
T 1 : = inf { s 0 | X s X 0 ( 1 + η ) or X s X 0 ( 1 η ) } ,
T 2 : = inf { s 0 | X ^ 0 , T 1 + s X 0 ( 1 + η ) and X ˇ 0 , T 1 + s X 0 ( 1 η ) } .
To measure the efficiency of profit-taking, we define the profitability function:
ϕ ( η ) : = E 2 η X 0 θ T 1 + T 2
for any take-profit rate η ( 0 , 1 ) . With definition (2) of T 1 , SDE (1) is rewritten equivalently: d X t = μ X t 1 { t < T 1 } d t + σ X t d W t . Next, we define two geometric Brownian motions ( Y t ) t I R + and ( Z t ) t I R + by d Y t = μ Y t d t + σ Y t d W t and d Z t = σ Z t d W t . For any positive sequence { t i } i I N that t i < t i + 1 for any i I N , in the event t i < T 1 for all i, { Y t i } i I N has the same joint distribution as { X t i } i I N . On the other hand, { Z t i } i I N has the same joint distribution as { X t i } i I N in the event that t i > s T 1 for all i. Therefore, in the following computation, we may substitute X t by Y t and Z t in each case, respectively.
For convenience, we define W t λ : = W t + λ t , λ : = μ σ σ 2 , S t : = sup 0 r t W r , and I t : = inf 0 r t W r .

3. Computation of Transaction Time

3.1. Independence between T 1 and T 2

In this subsection, we show by Lemma 1 the independence between T 1 and T 2 for further computation.
Lemma 1.
For any t 1 , t 2 > 0 , P ( T 1 d t 1 , T 2 d t 2 ) = P ( T 1 d t 1 ) P ( T 2 d t 2 ) , where T 1 , T 2 are defined by (2) and (3).
Proof. 
By definition (2) of T 1 , T 1 0 since X 0 > 0 , then X T 1 = X 0 ( 1 + η ) or X T 1 = X 0 ( 1 η ) , hence we have
P ( T 1 d t 1 , T 2 d t 2 ) = E [ 1 { T 1 d t 1 } E [ 1 { T 2 d t 2 } | T 1 d t 1 , X T 1 = X 0 ( 1 + η ) ] ] P ( X T 1 = X 0 ( 1 + η ) ) + E [ 1 { T 1 d t 1 } E [ 1 { T 2 d t 2 } | T 1 d t 1 , X T 1 = X 0 ( 1 η ) ] ] P ( X T 1 = X 0 ( 1 η ) ) .
To simplify (5), by definition (3), we note that
E [ 1 { T 2 d t 2 } | T 1 , X T 1 = X 0 ( 1 η ) ] = P ( inf { s 0 | Z ^ T 1 , T 1 + s X 0 ( 1 + η ) } d t 2 | T 1 , Z T 1 = X 0 ( 1 η ) ) ,
Applying the strong Markov property of ( Z t ) t I R + for all t T 1 given T 1 , we have
P ( inf { s 0 | Z ^ T 1 , T 1 + s X 0 ( 1 + η ) } d t 2 | T 1 , Z T 1 = X 0 ( 1 η ) ) = P log ( 1 + η ) log ( 1 η ) σ d S t 2 ,
where for the property of Wiener process, we apply Theorem 1.12 of [6]. Combining (6) and (7), we see that
E [ 1 { T 2 d t 2 } | T 1 , X T 1 = X 0 ( 1 η ) ] = P log ( 1 + η ) log ( 1 η ) σ d S t 2 .
By the symmetric property of Wiener process (see Chapter 2 of [7]),
E [ 1 { T 2 d t 2 } | T 1 d t 1 , X T 1 = X 0 ( 1 η ) ] = E [ 1 { T 2 d t 2 } | T 1 d t 1 , X T 1 = X 0 ( 1 + η ) ] .
By (5), (8), and (9), we obtain
P ( T 1 d t 1 , T 2 d t 2 ) = P ( T 1 d t 1 ) P log ( 1 + η ) log ( 1 η ) σ d S t 2 .
On the other hand, repeating the approach above, we see that
P ( T 2 d t 2 ) = P log ( 1 + η ) log ( 1 η ) σ d S t 2 ,
hence we conclude Lemma 1 by (10) and (11).                                   ☐

3.2. Distribution of T 1

Define a function G ( y , a , b , t ) for any a > y > b > 0 and t I R + by
G ( y , a , b , t ) = n = 1 [ κ ( t , y 2 b + 2 ( n 1 ) ( a b ) ) + κ ( t , y 2 a 2 ( n 1 ) ( a b ) ) κ ( t , y + 2 n ( a b ) ) κ ( t , y 2 n ( a b ) ) ] ,
where the normal density function κ is defined by κ ( t , x ) : = e x 2 2 t 2 π t for any t > 0 , x I R . Then, the distribution of T 1 is given by Proposition 2 as follows.
Proposition 1.
For any t > 0 ,
P ( T 1 < t ) = log ( 1 η ) σ log ( 1 + η ) σ e λ y 1 2 λ 2 t G y , log ( 1 + η ) σ , log ( 1 η ) σ , t d y + 1 Φ log ( 1 + η ) σ t t λ + Φ log ( 1 η ) σ t t λ ,
where Φ ( · ) denotes the distribution function of a standard normal variable.
Proof. 
By the definition (2) of T 1 , for any t > 0 , we have P ( T 1 < t ) = P ( Y ^ 0 , t X 0 ( 1 + η ) or Y ˇ 0 , t X 0 ( 1 η ) ) . Applying the standard technique of Girsanov theorem, cf. Theorem 8.6.4 of B. Oksendal [8], we obtain that P ( T 1 < t ) = E [ 1 { S t 1 σ log ( 1 + η ) or I t 1 σ log ( 1 η ) } e λ W t 1 2 λ 2 t ] , for which we then apply the Lemma 3 proved by some similar arguments as in Chapter 2.8 of [9]; the details of the proof are stated in the Appendix.             ☐
Lemma 3.
For any a > c > b > 0 , t > 0 and x ( a , b ) , we have
P ( S t a or I t b ; W t c | W 0 = x ) = n = 1 Φ c + x 2 n ( a b ) 2 a t + Φ c + x + 2 n ( a b ) 2 b t Φ c x + 2 n ( a b ) t Φ c x 2 n ( a b ) t Φ b + x 2 n ( a b ) 2 a t Φ b + x + 2 n ( a b ) 2 b t + Φ b x + 2 n ( a b ) t + Φ b x 2 n ( a b ) t .

4. Optimization of Take-Profit Levels

In this section, we express the profitability function in a closed-form and consider the maximization problem over η ( 0 , 1 ) . By (4) and (11), and Proposition 2, we have
ϕ ( η ) = ( 2 η X 0 θ ) ( R + ) 2 P ( d T 1 ) P ( d T 2 ) T 1 + T 2 = ( 2 η X 0 θ ) ( R + ) 2 1 t + s φ 1 ( t ) φ 2 ( s ) d t d s ,
where the probability density functions are given by
φ 1 ( t ) : = log ( 1 η ) σ log ( 1 + η ) σ e λ y 1 2 λ 2 t G t y , log ( 1 + η ) σ , log ( 1 η ) σ , t d y 1 2 λ 2 log ( 1 η ) σ log ( 1 + η ) σ e λ y 1 2 λ 2 t G y , log ( 1 + η ) σ , log ( 1 η ) σ , t d y 1 2 π e log ( 1 η ) σ λ t 2 2 σ 2 t log ( 1 η ) 2 σ t 3 + λ 2 t + 1 2 π e log ( 1 + η ) σ λ t 2 2 σ 2 t log ( 1 + η ) 2 σ t 3 + λ 2 t
for t > 0 , where the function G is defined by (12), and φ 2 ( t ) = log ( 1 + η ) log ( 1 η ) σ 2 π t 3 e log ( 1 + η ) log ( 1 η ) 2 2 σ 2 t for t > 0 . Then, we consider the maximization problem of setting suitable η. First, to enlarge ϕ ( η ) , we ensure it to be positive; therefore, η should satisfy the condition that η > θ 2 X 0 . Note that η ( 0 , 1 ) and θ < X 0 as we assumed before, η should be within ( θ 2 X 0 , 1 ) . Next, we check the convergence of the integration in (13). Actually, under the condition that η ( θ 2 X 0 , 1 ) , we see that 0 < ϕ ( η ) < ( 2 X 0 θ ) σ 2 ( log ( 2 X 0 + θ ) log ( 2 X 0 θ ) ) 2 , which also provides a uniform upper bound for the profitability function. The optimal take-profit rate η * = max η θ 2 X 0 , 1 | ϕ ( η ) = max θ 2 X 0 r 1 ϕ ( r ) , is ready to be solved numerically.

5. Numerical Simulation

In Table 1 below, we compare the testing errors and running time for both approaches. Note that the average testing errors are measured by comparison with the result obtained by programming with much more samples and smaller time discretization steps, which consume several times the running time. From the average running time listed, we conclude that our approach is much more efficient than that of crude Monte Carlo simulation. The reason is also mathematically obvious , as it is well known that E [ T 2 ] = while E 1 T 2 is finite, it is quite time-consuming to sample the stopping time T 2 (so is T 1 ). From the data of difference pairs of ( μ , σ ) obtained by both approaches, we find that the optimal take-profit level is more sensitive to the changes of σ than that of μ. Besides, larger volatility σ yields large optimal take-profit level, which reinforces the widely-held financial wisdom that the larger the volatility, the larger the take-profit level we can set.

6. Conclusion and Future Work

This paper gives an optimal stopping rule by characterizing the take-profit level. Compared to others’ effects on this, ours has less computational complexity and is applicable to improving the trading strategy for the issue of closing position. Our work can be extended to other more difficult models with regime switching, such as that with Markov chains; however, it could be challenging to get a closed form, since our work benefits from the advantages of Brownian motion.

Acknowledgments

The work is partly supported by National Natural Science Foundation of China (No. 11501294) and China Postdoctoral Science Foundation (2015M580374, 2016T90398).

Author Contributions

X.R. collected and processed the data, and checked results and manuscript. Y.L. drafted this manuscript, established the research paper design and paper methodology. A.Y. and H.Y gave suggestions for the input-output analysis and for the manuscript during the whole writing process. C.Z. helped processing raw data. All the authors have read and approved the final manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

In this section, we proceed to prove Lemma 3 by applying the technique in Chapter 2.8 of [9]. For any a > c > b > 0 , x ( a , b ) , t > 0 , we have
P x ( S t a or I t b ; W t c ) = n = 1 Φ c + x 2 n ( a b ) 2 a t + Φ c + x + 2 n ( a b ) 2 b t Φ c x + 2 n ( a b ) t Φ c x 2 n ( a b ) t Φ b + x 2 n ( a b ) 2 a t Φ b + x + 2 n ( a b ) 2 b t + Φ b x + 2 n ( a b ) t + Φ b x 2 n ( a b ) t .
Proof. 
First, several sequences of stopping time are defined as follows:
σ 0 = 0 , τ 0 = inf { t 0 | I t b } ;
π 0 = 0 , ρ 0 = inf { t 0 | S t a } ;
σ n = inf { t π n 1 | W t = a } ;
τ n = inf { t σ n 1 | W t = b } ;
π n = inf { t ρ n 1 | W t = b } ;
ρ n = inf { t π n 1 | W t = a } .
With the reflection property of Brownian motion (refer to [9]), for y ( b , a ) ,
P x ( W t y | F τ n ) = P x ( W t 2 b y | F τ n ) on { τ n t } ;
P x ( W t y | F τ n ) = P x ( W t 2 b y | F π n ) on { π n t } ;
P x ( W t y | F τ n ) = P x ( W t 2 a y | F σ n ) on { σ n t } ;
P x ( W t y | F τ n ) = P x ( W t 2 a y | F ρ n ) on { ρ n t } .
Note that 2 b y < b and 2 a y > a ; thereby, for any n 1 ,
P x ( W t y , τ n t ) = P x ( W t 2 b y , τ n t ) = P x ( W t 2 b y , σ n t ) ;
P x ( W t y , σ n t ) = P x ( W t 2 a y , σ n t ) = P x ( W t 2 a y , τ n 1 t ) ;
P x ( W t y , ρ n t ) = P x ( W t 2 a y , ρ n t ) = P x ( W t 2 a y , π n t ) ;
P x ( W t y , π n t ) = P x ( W t 2 b y , π n t ) = P x ( W t 2 b y , ρ n 1 t ) .
The above formulas are alternately and recursively applied to gain the following expressions. Therefore we have,
P x ( W t y , τ n t ) = P x ( W t 2 b y , σ n t ) = P x ( W t 2 a ( 2 b y ) , τ n 1 t ) = P x ( W t 2 b y 2 ( a b ) , σ n 1 t ) = P x ( W t y + 2 n ( a b ) , τ n n t ) = P x ( W t 2 b y 2 n ( a b ) , σ 0 t ) ,
and
P x ( W t y , σ n t ) = P x ( W t 2 a y , τ n 1 t ) = P x ( W t y 2 ( a b ) , σ n 1 t ) = P x ( W t y 2 n ( a b ) , σ 0 t ) .
Similarly, another two formulas are:
P x ( W t y , ρ n t ) = P x ( W t 2 a y + 2 n ( a b ) ) .
P x ( W t y , π n t ) = P x ( W t y + 2 n ( a b ) ) .
Taking the derivative regarding y in the above four formulas, another four expressions are gained.
P x ( W t d y , τ n t ) = κ ( t , x + y 2 b + 2 n ( a b ) ) d y ,
P x ( W t d y , σ n t ) = κ ( t , x y + 2 n ( a b ) ) d y ,
P x ( W t d y , ρ n t ) = κ ( t , x + y 2 a 2 n ( a b ) ) d y ,
P x ( W t d y , π n t ) = κ ( t , x y 2 n ( a b ) ) d y ,
where κ ( t , x ) = e x 2 2 t 2 π t as defined before, for any t > 0 , x R . Note that τ n 1 ρ n 1 = σ n π n and σ n π n = π n ρ n for any n 1 , then for any integer k 1 ,
P x ( W t d y , τ k ρ k t ) = P x ( W t d y , τ k t ) + P x ( W t d y , ρ k t ) P x ( W t d y , σ k π k t ) = P x ( W t d y , τ k t ) + P x ( W t d y , ρ k t ) [ P x ( W t d y , τ k 1 t ) + P x ( W t d y , ρ k 1 t ) P x ( W t d y , τ k 1 ρ k 1 t ) ] .
Repeatedly apply this recursive expression for k times, and have:
P x ( W t d y , τ k ρ k t ) = n = 1 k [ P x ( W t d y , σ n t ) + P x ( W t d y , π n t ) P x ( W t d y , τ n 1 t ) P x ( W t d y , ρ n 1 t ) ] + P x ( W t d y , τ 0 ρ 0 t ) .
Consider the convergence of the above summation when k goes to infinity. Since the summation equals P x ( W t d y , τ k ρ k t ) P x ( W t d y , τ 0 ρ 0 t ) , the above summation should decrease on k, and constrained within [ 1 , 1 ] , the limit exists and is bounded. Note that S t a or I t b is the same event as τ 0 ρ t , then pass k to infinity and gain that
P x ( W t d y , S t a or I t b ) = n = 1 [ P x ( W t d y , τ n 1 t ) + P x ( W t d y , ρ n 1 t ) P x ( W t d y , σ n t ) P x ( W t d y , π n t ) ] = n = 1 [ κ ( t , x + y 2 b + 2 ( n 1 ) ( a b ) ) + κ ( t , x + y 2 a 2 ( n 1 ) ( a b ) ) κ ( t , x y + 2 n ( a b ) ) κ ( t , x y 2 n ( a b ) ) ] d y .
Finally, take integration regarding y from b to c, and hence complete the proof.                   ☐

References

  1. Vidyamurthy, G. Pairs Trading: Quantitative Methods and Analysis. Pearson Schweiz Ag. 2004, 35–47. [Google Scholar]
  2. Eloe, P.; Liu, R.H.; Yatsuki, M.; Yin, G.; Zhang, Q. Optimal selling rules in a regime-switching exponential Gaussian diffusion model. SIAM J. Appl. Math. 2008, 69, 810–829. [Google Scholar] [CrossRef]
  3. Hamilton, J.D. A new approach to the economic analysis of non-stationary time series. Econometrica 1989, 57, 357–384. [Google Scholar] [CrossRef]
  4. Yao, D.D.; Zhang, Q.; Zhou, X.Y. A regime-switching model for European options. Int. Ser. Oper. Res. Manag. Sci. 2006, 94, 281–300. [Google Scholar]
  5. Hammersley, J.M.; Handscomb, D.C. Monte Carlo Methods. Springer Neth. 1964, 30, 347–385. [Google Scholar]
  6. Mörters, P.; Peres, Y. Brownian Motion; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  7. Schilling, R.L.; Böttcher, B.; Partzsch, L. Brownian Motion: An Introduction to Stochastic Processes; Walter de Gruyter GmbH & Co KG: Berlin, Germany, 2012. [Google Scholar]
  8. Oksendal, B. Stochastic Differential Equations, 6th ed.; Springer: New York, NY, USA, 2003. [Google Scholar]
  9. Karatzas, I.; Shreve, S.E. Brownian Motion and Stochastic Calculus; Springer: New York, NY, USA; Berlin, Germany, 1991. [Google Scholar]
Table 1. For 25 pairs of parameters ( μ , σ ) , we report the value of η obtained by Monte Carlo simulations and our approach of maximization of the closed-form.
Table 1. For 25 pairs of parameters ( μ , σ ) , we report the value of η obtained by Monte Carlo simulations and our approach of maximization of the closed-form.
X 0 = 10 , θ = 0.001 σ = 0.10 σ = 0.15 σ = 0.20 σ = 0.25 σ = 0.30
Monte Carlo - = 0.05 0.029 0.042 0.046 0.058 0.064
- = 0.10 0.031 0.047 0.049 0.056 0.072
- = 0.15 0.035 0.049 0.053 0.064 0.077
- = 0.20 0.038 0.050 0.058 0.080 0.095
- = 0.25 0.039 0.058 0.063 0.084 0.103
Average Testing Errors0.028
Average Running Time54.60 min
Our method - = 0.05 0.028 0.040 0.049 0.056 0.068
- = 0.10 0.032 0.045 0.051 0.061 0.075
- = 0.15 0.035 0.051 0.054 0.066 0.080
- = 0.20 0.040 0.052 0.059 0.077 0.091
- = 0.25 0.041 0.061 0.065 0.083 0.096
Average Testing Errors0.011
Average Running Time30.11 min

Share and Cite

MDPI and ACS Style

Rui, X.; Liu, Y.; Yang, A.; Yang, H.; Zhang, C. Optimization of Setting Take-Profit Levels for Derivative Trading. Math. Comput. Appl. 2017, 22, 1. https://doi.org/10.3390/mca22010001

AMA Style

Rui X, Liu Y, Yang A, Yang H, Zhang C. Optimization of Setting Take-Profit Levels for Derivative Trading. Mathematical and Computational Applications. 2017; 22(1):1. https://doi.org/10.3390/mca22010001

Chicago/Turabian Style

Rui, Xiaodong, Yue Liu, Aijun Yang, Hongqiang Yang, and Chengcui Zhang. 2017. "Optimization of Setting Take-Profit Levels for Derivative Trading" Mathematical and Computational Applications 22, no. 1: 1. https://doi.org/10.3390/mca22010001

Article Metrics

Back to TopTop