MinimumImpactTradingTrajectory.java

  1. package org.drip.execution.strategy;

  2. /*
  3.  * -*- mode: java; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
  4.  */

  5. /*!
  6.  * Copyright (C) 2020 Lakshmi Krishnamurthy
  7.  * Copyright (C) 2019 Lakshmi Krishnamurthy
  8.  * Copyright (C) 2018 Lakshmi Krishnamurthy
  9.  * Copyright (C) 2017 Lakshmi Krishnamurthy
  10.  * Copyright (C) 2016 Lakshmi Krishnamurthy
  11.  *
  12.  *  This file is part of DROP, an open-source library targeting analytics/risk, transaction cost analytics,
  13.  *      asset liability management analytics, capital, exposure, and margin analytics, valuation adjustment
  14.  *      analytics, and portfolio construction analytics within and across fixed income, credit, commodity,
  15.  *      equity, FX, and structured products. It also includes auxiliary libraries for algorithm support,
  16.  *      numerical analysis, numerical optimization, spline builder, model validation, statistical learning,
  17.  *      and computational support.
  18.  *  
  19.  *      https://lakshmidrip.github.io/DROP/
  20.  *  
  21.  *  DROP is composed of three modules:
  22.  *  
  23.  *  - DROP Product Core - https://lakshmidrip.github.io/DROP-Product-Core/
  24.  *  - DROP Portfolio Core - https://lakshmidrip.github.io/DROP-Portfolio-Core/
  25.  *  - DROP Computational Core - https://lakshmidrip.github.io/DROP-Computational-Core/
  26.  *
  27.  *  DROP Product Core implements libraries for the following:
  28.  *  - Fixed Income Analytics
  29.  *  - Loan Analytics
  30.  *  - Transaction Cost Analytics
  31.  *
  32.  *  DROP Portfolio Core implements libraries for the following:
  33.  *  - Asset Allocation Analytics
  34.  *  - Asset Liability Management Analytics
  35.  *  - Capital Estimation Analytics
  36.  *  - Exposure Analytics
  37.  *  - Margin Analytics
  38.  *  - XVA Analytics
  39.  *
  40.  *  DROP Computational Core implements libraries for the following:
  41.  *  - Algorithm Support
  42.  *  - Computation Support
  43.  *  - Function Analysis
  44.  *  - Model Validation
  45.  *  - Numerical Analysis
  46.  *  - Numerical Optimizer
  47.  *  - Spline Builder
  48.  *  - Statistical Learning
  49.  *
  50.  *  Documentation for DROP is Spread Over:
  51.  *
  52.  *  - Main                     => https://lakshmidrip.github.io/DROP/
  53.  *  - Wiki                     => https://github.com/lakshmiDRIP/DROP/wiki
  54.  *  - GitHub                   => https://github.com/lakshmiDRIP/DROP
  55.  *  - Repo Layout Taxonomy     => https://github.com/lakshmiDRIP/DROP/blob/master/Taxonomy.md
  56.  *  - Javadoc                  => https://lakshmidrip.github.io/DROP/Javadoc/index.html
  57.  *  - Technical Specifications => https://github.com/lakshmiDRIP/DROP/tree/master/Docs/Internal
  58.  *  - Release Versions         => https://lakshmidrip.github.io/DROP/version.html
  59.  *  - Community Credits        => https://lakshmidrip.github.io/DROP/credits.html
  60.  *  - Issues Catalog           => https://github.com/lakshmiDRIP/DROP/issues
  61.  *  - JUnit                    => https://lakshmidrip.github.io/DROP/junit/index.html
  62.  *  - Jacoco                   => https://lakshmidrip.github.io/DROP/jacoco/index.html
  63.  *
  64.  *  Licensed under the Apache License, Version 2.0 (the "License");
  65.  *      you may not use this file except in compliance with the License.
  66.  *  
  67.  *  You may obtain a copy of the License at
  68.  *      http://www.apache.org/licenses/LICENSE-2.0
  69.  *  
  70.  *  Unless required by applicable law or agreed to in writing, software
  71.  *      distributed under the License is distributed on an "AS IS" BASIS,
  72.  *      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  73.  *  
  74.  *  See the License for the specific language governing permissions and
  75.  *      limitations under the License.
  76.  */

  77. /**
  78.  * <i>MinimumImpactTradingTrajectory</i> holds the Trajectory of a Trading Block that is to be executed
  79.  * uniformly over Equal Intervals, the Idea being to minimize the Trading Impact. The References are:
  80.  *
  81.  * <br><br>
  82.  *  <ul>
  83.  *      <li>
  84.  *          Almgren, R., and N. Chriss (1999): Value under Liquidation <i>Risk</i> <b>12 (12)</b>
  85.  *      </li>
  86.  *      <li>
  87.  *          Almgren, R., and N. Chriss (2000): Optimal Execution of Portfolio Transactions <i>Journal of
  88.  *              Risk</i> <b>3 (2)</b> 5-39
  89.  *      </li>
  90.  *      <li>
  91.  *          Bertsimas, D., and A. W. Lo (1998): Optimal Control of Execution Costs <i>Journal of Financial
  92.  *              Markets</i> <b>1</b> 1-50
  93.  *      </li>
  94.  *      <li>
  95.  *          Chan, L. K. C., and J. Lakonishak (1995): The Behavior of Stock Prices around Institutional
  96.  *              Trades <i>Journal of Finance</i> <b>50</b> 1147-1174
  97.  *      </li>
  98.  *      <li>
  99.  *          Keim, D. B., and A. Madhavan (1997): Transaction Costs and Investment Style: An Inter-exchange
  100.  *              Analysis of Institutional Equity Trades <i>Journal of Financial Economics</i> <b>46</b>
  101.  *              265-292
  102.  *      </li>
  103.  *  </ul>
  104.  *
  105.  *  <br><br>
  106.  *  <ul>
  107.  *      <li><b>Module </b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/ProductCore.md">Product Core Module</a></li>
  108.  *      <li><b>Library</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/TransactionCostAnalyticsLibrary.md">Transaction Cost Analytics</a></li>
  109.  *      <li><b>Project</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/execution/README.md">Optimal Impact/Capture Based Trading Trajectories - Deterministic, Stochastic, Static, and Dynamic</a></li>
  110.  *      <li><b>Package</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/execution/strategy/README.md">Discrete/Continuous Trading Trajectory Schedule</a></li>
  111.  *  </ul>
  112.  *  
  113.  * @author Lakshmi Krishnamurthy
  114.  */

  115. public class MinimumImpactTradingTrajectory extends org.drip.execution.strategy.DiscreteTradingTrajectory {

  116.     /**
  117.      * Create a MinimumImpactTradingTrajectory Instance from Equal Intervals
  118.      *
  119.      * @param dblStartHoldings Trajectory Start Holdings
  120.      * @param dblFinishHoldings Trajectory Finish Holdings
  121.      * @param dblStartTime Trajectory Start Time
  122.      * @param dblFinishTime Trajectory Finish Time
  123.      * @param iNumInterval The Number of Fixed Intervals
  124.      *
  125.      * @return The MinimumImpactTradingTrajectory Instance from Fixed Intervals
  126.      */

  127.     public static final MinimumImpactTradingTrajectory Standard (
  128.         final double dblStartHoldings,
  129.         final double dblFinishHoldings,
  130.         final double dblStartTime,
  131.         final double dblFinishTime,
  132.         final int iNumInterval)
  133.     {
  134.         if (!org.drip.numerical.common.NumberUtil.IsValid (dblStartHoldings) ||
  135.             !org.drip.numerical.common.NumberUtil.IsValid (dblFinishHoldings) ||
  136.                 !org.drip.numerical.common.NumberUtil.IsValid (dblStartTime) ||
  137.                     !org.drip.numerical.common.NumberUtil.IsValid (dblFinishTime) || dblStartTime >=
  138.                         dblFinishTime || 0 >= iNumInterval)
  139.             return null;

  140.         double dblTradeList = (dblFinishHoldings - dblStartHoldings) / iNumInterval;
  141.         double dblTimeInterval = (dblFinishTime - dblStartTime) / iNumInterval;
  142.         double[] adblExecutionTimeNode = new double[iNumInterval + 1];
  143.         double[] adblHoldings = new double[iNumInterval + 1];
  144.         adblExecutionTimeNode[iNumInterval] = dblFinishTime;
  145.         double[] adblTradeList = new double[iNumInterval];
  146.         adblHoldings[iNumInterval] = dblFinishHoldings;
  147.         adblExecutionTimeNode[0] = dblStartTime;
  148.         adblHoldings[0] = dblStartHoldings;
  149.         adblTradeList[0] = dblTradeList;

  150.         for (int i = 1; i < iNumInterval; ++i) {
  151.             adblTradeList[i] = dblTradeList;
  152.             adblHoldings[i] = dblStartHoldings + i * dblTradeList;
  153.             adblExecutionTimeNode[i] = dblStartTime + i * dblTimeInterval;
  154.         }

  155.         try {
  156.             return new MinimumImpactTradingTrajectory (adblExecutionTimeNode, adblHoldings, adblTradeList);
  157.         } catch (java.lang.Exception e) {
  158.             e.printStackTrace();
  159.         }

  160.         return null;
  161.     }

  162.     protected MinimumImpactTradingTrajectory (
  163.         final double[] adblExecutionTimeNode,
  164.         final double[] adblHoldings,
  165.         final double[] adblTradeList)
  166.         throws java.lang.Exception
  167.     {
  168.         super (adblExecutionTimeNode, adblHoldings, adblTradeList);
  169.     }

  170.     /**
  171.      * Retrieve the Trade Size
  172.      *
  173.      * @return The Trade Size
  174.      */

  175.     public double tradeSize()
  176.     {
  177.         double[] adblHoldings = holdings();

  178.         return adblHoldings[1] - adblHoldings[0];
  179.     }

  180.     /**
  181.      * Retrieve the Trade Time Interval
  182.      *
  183.      * @return The Trade Time Interval
  184.      */

  185.     public double tradeTimeInterval()
  186.     {
  187.         double[] adblExecutionTimeNode = executionTimeNode();

  188.         return adblExecutionTimeNode[1] - adblExecutionTimeNode[0];
  189.     }

  190.     /**
  191.      * Retrieve the Trade Rate
  192.      *
  193.      * @return The Trade Rate
  194.      */

  195.     public double tradeRate()
  196.     {
  197.         double[] adblHoldings = holdings();

  198.         double[] adblExecutionTimeNode = executionTimeNode();

  199.         return (adblHoldings[1] - adblHoldings[0]) / (adblExecutionTimeNode[1] - adblExecutionTimeNode[0]);
  200.     }
  201. }