TY - JOUR

T1 - Risk profile problem for stock portfolio optimization

AU - Kao, Ming Yang

AU - Nolte, Andreas

AU - Tate, Stephen R.

PY - 2000/12/3

Y1 - 2000/12/3

N2 - In this paper we study the problem of determining an optimal investment strategy for investors with different attitudes toward the trade-offs of risk and profit. The probability distribution of the return values of the stocks that are considered by the investor are assumed to be known, while the joint distribution is unknown. The problem is to find the best investment strategy in order to minimize the probability of losing a certain percentage of the invested capital based on different attitudes of the investors toward future outcomes of the stock market. We show that for portfolios made up of two stocks, we can exactly and quickly solve the problem of finding an optimal portfolio for aggressive or risk-averse investors, using an algorithm based on a fast greedy solution to a maximum flow problem. However, an investor looking for an average-case guarantee (so is neither aggressive or risk-averse) must deal with a more difficult problem. In particular, we show that computing the distribution function associated with the average-case bound is #P-complete. On the positive side, we show how to use random sampling techniques similar to those for high-dimensional volume estimation to provide approximate answers. When k>2 stocks are considered, we show that a simple solution based on the same flow concepts as our 2-stock algorithm would imply that P = NP, so is highly unlikely. We give approximation algorithms for this case as well as exact algorithms for some important special cases.

AB - In this paper we study the problem of determining an optimal investment strategy for investors with different attitudes toward the trade-offs of risk and profit. The probability distribution of the return values of the stocks that are considered by the investor are assumed to be known, while the joint distribution is unknown. The problem is to find the best investment strategy in order to minimize the probability of losing a certain percentage of the invested capital based on different attitudes of the investors toward future outcomes of the stock market. We show that for portfolios made up of two stocks, we can exactly and quickly solve the problem of finding an optimal portfolio for aggressive or risk-averse investors, using an algorithm based on a fast greedy solution to a maximum flow problem. However, an investor looking for an average-case guarantee (so is neither aggressive or risk-averse) must deal with a more difficult problem. In particular, we show that computing the distribution function associated with the average-case bound is #P-complete. On the positive side, we show how to use random sampling techniques similar to those for high-dimensional volume estimation to provide approximate answers. When k>2 stocks are considered, we show that a simple solution based on the same flow concepts as our 2-stock algorithm would imply that P = NP, so is highly unlikely. We give approximation algorithms for this case as well as exact algorithms for some important special cases.

UR - http://www.scopus.com/inward/record.url?scp=0033706248&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033706248&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033706248

SP - 228

EP - 234

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SN - 0734-9025

ER -