Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference16 articles.
1. Allenberg-Neeman, C., & Neeman, B. (2004). Full information game with gains and losses. In 15th international conference on algorithmic learning theory.
2. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2003). The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1), 48–77.
3. Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. Cambridge: Cambridge University Press.
4. Cesa-Bianchi, N., Mansour, Y., & Stoltz, G. (2007). Improved second-order bounds for prediction with expert advice. Machine Learning, 66(2–3), 21–352.
5. Cover, T. (1991). Universal portfolios. Mathematical Finance, 1, 1–19.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献