You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A portfolio which has a maximum expected growth rate is often referred to in the literature as a logoptimal portfolio or a growth-optimal portfolio. The origin of the log-optimal portfolio is arguably
13
+
due to Kelly when he observed that logarithmic wealth is additive in sequential investments and
14
+
invented a betting strategy for gambling that relies on results from information theory. As a result of
15
+
the law of large numbers, if investment returns are serially independent and identically distributed,
16
+
the growth rate of any constant rebalanced portfolio (the log-optimal portfolio included) converges
17
+
to its expectation. Moreover, under such conditions, one of the strongest advantages of the logoptimal portfolio is that, when implemented repeatedly, the log-optimal portfolio outperforms any
18
+
other causal portfolio in the long run with probability 1. In other words, if all of these conditions
19
+
are met, there is no sequence of portfolios that has a higher growth rate than that of the log-optimal
20
+
portfolio. Stock markets however are different from casinos in the sense that investment returns are
21
+
not serially independent and identically distributed. Also, since trading incurs transaction costs,
22
+
investors are discouraged from making frequent trades. Plus, the probability distribution of stock
23
+
returns is never precisely known, which impedes the calculation of the log-optimal portfolio. In
24
+
this project, we generalize the results for the log-optimal portfolio. In particular, we establish similar guarantees for finite investment horizons where the distribution of stock returns is ambiguous.
25
+
By focusing on constant rebalanced portfolios, we exploit temporal symmetries to formulate the
26
+
emerging distributionally robust optimization problems as tractable conic programs whose sizes are
27
+
independent of the investment horizon.
28
+
9
29
## Distributionally Robust Reward-risk Ratio Programming with Wasserstein Metric [pdf](https://optimization-online.org/wp-content/uploads/2017/01/5805.pdf)
0 commit comments