# Investment strategies, lazy evaluation and memoization

# The problem

This article will cover an interesting problem: given a set of possible investments, each with different tax rates, yearly rates and minimum time until withdrawal, what is the best investment strategy for the next 10, 20 or *n* years?

For instance, given the following investments:

*i*_{1}= 9% yearly rate, 25% taxes on profits upon withdrawal 1 year later

*i*_{2}= 8% yearly rate, 15% taxes on profits upon withdrawal 5 years later

*i*_{3}= 7% yearly rate, 0% taxes and withdrawal 3 years later

If we want to maximize earnings over 10 years, should we purchase *i*_{1} ten times, *i*_{2} twice, *i*_{3} three times and one *i*_{1}, *i*_{3} once and *i*_{2} once and *i*_{1} twice or some other combination?

Before we go into programming, let’s do some basic math/algorithms. This is all simple math, so don’t worry. You can also skip to **programming** if you prefer.

**Theorem 1**: The final value to withdraw with any investment i such as the ones exemplified can be written as product of the initial value and a factor defined by the investment i, *e*(*i*) = 1 + (1 − *t**a**x**e**s*) ⋅ ((1 + *y**e**a**r**l**y**R**a**t**e*)^{time} − 1)

**Proof**: Given some initial value v and composite yearly interest rates r, investment time t and taxes on profits taxes:

*p**r**o**f**i**t**s**B**e**f**o**r**e**T**a**x**e**s* = *v* ⋅ (1 + *r*)^{t} − *v* = *v* ⋅ ((1 + *r*)^{t} − 1)

*p**r**o**f**i**t**s**A**f**t**e**r**T**a**x**e**s* = *p**r**o**f**i**t**s**B**e**f**o**r**e**T**a**x**e**s* ⋅ (1 − *t**a**x**e**s*)

*p**r**o**f**i**t**s**A**f**t**e**r**T**a**x**e**s* = *v* ⋅ ((1 + *r*)^{t} − 1) ⋅ (1 − *t**a**x**e**s*)

*f**i**n**a**l**V**a**l**u**e* = *v* + *p**r**o**f**i**t**s**A**f**t**e**r**T**a**x**e**s* = *v* + *v* ⋅ ((1 + *r*)^{t} − 1) ⋅ (1 − *t**a**x**e**s*)

*f**i**n**a**l**V**a**l**u**e* = *v* ⋅ (1 + ((1 + *r*)^{t} − 1) ⋅ (1 − *t**a**x**e**s*))

The previous line proves the existence of the factor. Now, since *f**i**n**a**l**V**a**l**u**e* = *v* ⋅ *e*(*i*):

*e*(*i*) = *f**i**n**a**l**V**a**l**u**e*/*v* = 1 + (1 − *t**a**x**e**s*) ⋅ ((1 + *r*)^{t} − 1)

**Theorem 2**: Given a set of possible investments and a deadline *n*, the best investment strategy *s*_{n} = *e*(*i*_{1}) ⋅ *e*(*i*_{2}) ⋅ ... ⋅ *e*(*i*_{j}), any sub-strategy contained in *s*_{n} is the best strategy for the sum of the times of the investments contained in it.

**Proof**: Without loss of generality, let us consider *s*_{n} = *s*_{a} ⋅ *s*_{b}, with *a* + *b* = *n* and 0 < *a* < *n* and assume the contrary: *s*_{a} is not the best strategy for time *a*, but *s*_{n} is the best strategy for time *n*. So there must be *s*′_{a} > *s*_{a}, and that would mean *s*′_{n} = *s*′_{a} ⋅ *s*_{b} > *s*_{n}, which contradicts *s*_{n} being the best strategy. Therefore, there can be no *s*′_{a} > *s*_{a} and *s*_{a} is optimal.

## Programming

Maybe you skipped the last part, but don’t worry. I’ll just roll out the recursive solution to the problem. How do we describe the list of investments to be made that maximizes earnings after some time n?

*s*_{0} = 1 *s*_{n} = *m**a**x*{*s*_{1} ⋅ *s*_{n − 1}, *s*_{2} ⋅ *s*_{n − 2}, ..., *s*_{n − 1} ⋅ *s*_{1}, *i*}, with *i* = investment with largest *e*(*i*) of all possible investments of *t**i**m**e* = *n*

This basically means we test every possible combination, which is not very smart, of course. The advantage of finding a recursive solution is that we can compute and store calculations for use later on. This is what we call memoization.

Also, we only need to check up to *s*_{floor(n/2)} ⋅ *s*_{n − floor(n/2)}, since every other check is redundant.

How do we implement this? In a procedural language we could use an array of size n and fill it up with all solutions from 0 to n. In Haskell we generally don’t want to use mutable data structures nor do we want to specify the order of evaluation of things, so we must find another tool in the toolbox to do this; it turns out that lazy evaluation is just that!

Lazy evaluation is, roughly speaking, a mechanism by which a value is only computed when required by some function. This means that we can define a data structure in terms of itself, and that it can even be infinite. Take the following example:

What happens here is that the function repeat takes an object of some type a and returns a possibly infinite list of a. The list will grow in size as more elements of it are demanded by evaluation. Let us take this idea to implement our bestStrategyFunctionBad:

```
-- We use the "investment" below to make sure the algorithm always returns some strategy, even if it means leaving your money in the bank
investmentLeaveInTheBank :: Investment
investmentLeaveInTheBank = Investment { name = "Leave it in the bank account", rate = 0, taxes = 0.0, time = 1 }
withMax :: Ord a => (b -> a) -> [b] -> Maybe b
withMax f xs = snd maybeRes
where maybeRes = foldl' (\acc el ->case acc of
Just (maxVal, maxEl) -> let cmp = f el in if cmp > maxVal then Just (cmp, el) else acc
Nothing -> Just (f el, el)) Nothing xs
withMax1 :: Ord a => (b -> a) -> b -> [b] -> b
withMax1 f firstEl xs = snd $ foldl' (\acc@(maxVal, _) el -> let cmp = f el in if cmp > maxVal then (cmp, el) else acc) (f firstEl, firstEl) xs
bestStrategyBad :: Int -> [Investment] -> [Investment]
bestStrategyBad timeInYears invs' = go !! timeInYears
where invs = investmentLeaveInTheBank : invs'
factorStrategyBad is = product $ fmap factorInvestment is
bestStrat desiredTime = withMax1 factorStrategyBad (maybeToList (bestInvestmentWithTime desiredTime)) (allCombinations desiredTime)
bestInvestmentWithTime desiredTime = withMax factorInvestment $ filter (\i -> time i == desiredTime) invs
-- For desiredTime=7 "allCombinations" returns strategies e1 ++ e6, e2 ++ e5 and e3 ++ e4
allCombinations desiredTime = let halfTheTime = floor (fromIntegral desiredTime / 2)
in fmap (\i -> go !! i ++ go !! (desiredTime - i)) [1..halfTheTime]
go :: [[Investment]]
go = [] : fmap bestStrat [1..]
```

There is nothing magical about the code above. When demanding `go !! 20`

, for instance, the function bestStrat will be called with the value 20, which will demand all possible strategy investments (as defined by our equations). Demanding all combinations will once again require `go !! 19`

, `go !! 18`

and many others, which will repeat the process for a smaller *n* (the fact that they are smaller is crucial for our recursion to converge).

What is different from recursion in imperative languages is that go is not a function: it is a list whose values are lazily calculated. As values are demanded from it, they are calculated only once, so you don’t have to worry about what order to evaluate things in. In C# this is sort of like a `List<Lazy<Investment[]>>`

.

This is nice! Still, there are two bad things about this solution:

1. `go`

is a list, so accessing `go !! n`

is *O*(*n*). If this were an array this would be better. We will not tackle this issue for now, but feel free to do so!

2. We are creating a large number of lists with the `(++)`

function, not to mention that once we combine two strategies we have to go through every investment in the combined strategy to calculate its complete factor, when we could do better.

So now let’s go and solve issue number 2.

## More lazy evaluation and a little abstraction

So, how can we solve issue number 2? Combining two strategies leads to a strategy with a factor that is the product of the factors of each strategy. There is no need to concatenate lists to discover the best strategy of some given size. To avoid needless work, we need more lazy evaluation. Let’s add some functions to our code and create the `bestStrategyGood`

function:

```
data StrategyCalc = StrategyCalc [Investment] Double
factorStrategyGood (StrategyCalc _ x) = x
combine :: StrategyCalc -> StrategyCalc -> StrategyCalc
combine (StrategyCalc s1 f1) (StrategyCalc s2 f2) = StrategyCalc (s1 ++ s2) (f1 * f2)
bestStrategyGood :: Int -> [Investment] -> [Investment]
bestStrategyGood timeInYears invs' = let StrategyCalc res _ = go !! timeInYears in res
where invs = investmentLeaveInTheBank : invs'
bestStrat desiredTime = withMax1 factorStrategyGood (bestInvestmentWithTimeOr1 desiredTime) (allCombinations desiredTime)
bestInvestmentWithTimeOr1 desiredTime = case withMax factorInvestment $ filter (\i -> time i == desiredTime) invs of
Nothing -> StrategyCalc [] 1
Just i -> StrategyCalc [i] (factorInvestment i)
-- For desiredTime=7 "allCombinations" returns strategies e1 ++ e6, e2 ++ e5 and e3 ++ e4
allCombinations desiredTime = let halfTheTime = floor (fromIntegral desiredTime / 2)
in fmap (\i -> combine (go !! i) (go !! (desiredTime - i))) [1..halfTheTime]
go :: [StrategyCalc]
go = StrategyCalc [] 1 : fmap bestStrat [1..]
```

Take your time to digest this: the list of investments in each `StrategyCalc`

will only be evaluated when the caller needs it to be evaluated. However, the combine function will create a `StrategyCalc`

whose factor is calculated in constant time when combining two strategies. In fact, you could even have the final factor of the optimal strategy without having ever constructed a non empty list. Nice!

## A little abstraction (skip to results if you prefer)

I thought a nice touch to finish this article would be to introduce an abstraction: the Monoid.

A Monoid is just a fancy name for a binary operation that is associative and a value that is an identity for this operation. The Int type, the sum function (+) and the value 0 (zero) form an instance of Monoid, for instance, since any number plus zero equals itself and (*a* + *b*) + *c* = *a* + (*b* + *c*) for any *a*, *b*, *c* of type Int.

The same thing happens with investment strategies! So we can replace the combine function by the Monoidal append:

```
instance Monoid StrategyCalc where
mempty = StrategyCalc [] 1
mappend (StrategyCalc i1 f1) (StrategyCalc i2 f2) = StrategyCalc (i1 ++ i2) (f1 * f2)
```

Don’t forget that `<>`

is an infix alias for mappend!

## Results

When taking the code for bestStrategyGood and the three investments from the beginning of the article, let us devise the best strategy to maximize gains over the next 11 years:

```
$ ghci
$ :l Investments.hs
ghci> let availableInvestments = [ Investment { name = "Investment 1", rate = 0.09, taxes = 0.25, time = 1 }
, Investment { name = "Investment 2", rate = 0.08, taxes = 0.15, time = 5 }
, Investment { name = "Investment 3", rate = 0.07, taxes = 0, time = 3 } ]
ghci> fmap name $ bestStrategyGood 11 availableInvestments
["Investment 3","Investment 3","Investment 2"]
```

So it seems that buying investment 3, rebuying it and then buying investment 2 is the best strategy in this case.

That’s it! I hope you liked it, and if it helps, do know that this problem is still solvable with the same algorithm if the tax of each investment is a function of the amount of time since the investment title was purchased and if the time until withdrawal is either an exact time or a minimum time. It is also possible to include inflation-correcting investments if you pass around some estimated inflation; all of this with only minor modifications. Also, feel free to change the time unit to months and get something much more precise for your investments!