1BORODIN A,EI - YANIV R. Online computation and competitive analysis[ M ]. Cambridge University, Press,1998.
2BEN - DAVID S, BORODIN A. On the power of randomization in online algorithms [P] . In Proc. 22nd Symposium on Theory of Algorithms, 1990:379 - 386.
3COVER T M. Universal portfolio [J] . Mathematics Finance, 1991, 1 (1): 1-29.
4COVER T M, ORDENTLJCH E. Universal portfolio with side information [J] . IEEE Transactions on Information Theory, 1996, 42 (2) : 348 -363.
5BLUM A, KALAI A. Universal portfolios with and without transaction costs[J].Machine Learning, 1999, 35 (3) : 193 -205.
6GILLES STOLTZ, GABOR LUGOSI. Internal regret in on - line portfolio selection [J] . Machine Learning, 2005, 59, 125 - 159.
7EL - YANIV R, FIAT A, KARP R M, TURPIN G Optimal search and one way trading online algorithms [ J ] . Algorithmica, 2001,30:101 - 139.
8CHOU A, COOPERSTOCK J R, EL - YANIV R, KLUGERMAN M, LEIGHTON T. The statistical adversary allows optimal money - making trading strategies [ P] . Proceedings of the 6th Annual ACM - SIAM Symposium on Discrete Algorithms, 1995: 467-476.
9CHEN G H, KAO M Y, DAUHLYUU Y, WONG H K. Optimal buy - and - hold strategies for financial markets with bounded daily returns [ J ] . SIAM Journal on Computing, 2001,31 (2) : 447 -459.
10AL - BINALI S. A risk - reward framework for the competitive analysis of financial games [ J] . Algorithmica, 1999, 25: 99-115.
