Can We Learn to Beat the Best Stock

A. Borodin, R. El-Yaniv and V. Gogan

Papers from arXiv.org

Abstract: A novel algorithm for actively trading stocks is presented. While traditional expert advice and "universal" algorithms (as well as standard technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirical results on historical markets provide strong evidence that this type of technical trading can "beat the market" and moreover, can beat the best stock in the market. In doing so we utilize a new idea for smoothing critical parameters in the context of expert learning.

Date: 2011-06
New Economics Papers: this item is included in nep-cmp and nep-fmk
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Published in Journal Of Artificial Intelligence Research, Volume 21, pages 579-594, 2004

Downloads: (external link)
http://arxiv.org/pdf/1107.0036 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1107.0036

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().