Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
Authors:
- Gen-Huey ChenGCGen-Huey Chen
- Ming-Yang KaoMKMing-Yang Kao
- Yuh-Dauh LyuuYLYuh-Dauh Lyuu
- Hsing-Kuo WongHWHsing-Kuo Wong
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 31 (2) , 447-459
Abstract
In the context of investment analysis, we formulate an abstract online computing problem called a planning game and develop general tools for solving such a game. We then use the tools to investigate a practical buy-and-hold trading problem faced by long-term investors in stocks. We obtain the unique optimal static online algorithm for the problem and determine its exact competitive ratio. We also compare this algorithm with the popular dollar averaging strategy using actual market data.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Optimal Search and One-Way Trading Online AlgorithmsAlgorithmica, 2001
- Competitive solutions for online financial problemsACM Computing Surveys, 1998
- Universal portfolios with side informationIEEE Transactions on Information Theory, 1996
- The Mathematics of Financial Derivatives1995
- Online matching with blocked inputInformation Processing Letters, 1991
- Universal PortfoliosMathematical Finance, 1991
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- The Secretary Problem and Its Extensions: A ReviewInternational Statistical Review, 1983
- New Algorithms for Bin PackingJournal of the ACM, 1980
- Optimal selection based on relative rank (the “secretary problem”)Israel Journal of Mathematics, 1964