Designing Proxies for Stock Market Indices is Computationally Hard
| dc.creator | Kao, Ming-Yang | |
| dc.creator | Tate, Stephen R. | |
| dc.date | 2000-11-13 | |
| dc.date.accessioned | 2026-07-07T03:16:42Z | |
| dc.date.available | 2026-07-07T03:16:42Z | |
| dc.description | In this paper, we study the problem of designing proxies (or portfolios) for various stock market indices based on historical data. We use four different methods for computing market indices, all of which are formulas used in actual stock market analysis. For each index, we consider three criteria for designing the proxy: the proxy must either track the market index, outperform the market index, or perform within a margin of error of the index while maintaining a low volatility. In eleven of the twelve cases (all combinations of four indices with three criteria except the problem of sacrificing return for less volatility using the price-relative index) we show that the problem is NP-hard, and hence most likely intractable. | |
| dc.description | An abstract appeared in the Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999 | |
| dc.identifier | https://arxiv.org/abs/cs/0011016 | |
| dc.identifier | http://arxiv.org/abs/cs/0011016 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30455 | |
| dc.subject | Computational Engineering, Finance, and Science | |
| dc.subject | Computational Complexity | |
| dc.subject | F.2.2;G.2.3;J.4 | |
| dc.title | Designing Proxies for Stock Market Indices is Computationally Hard | |
| dc.type | text |