[7] P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. SIAM journal of computing, 32:48-77, 2002.
[8] K. Azuma. Weighted sums of certain dependent random variables. Tohoku Mathematical Journal, Second Series, 19(3):357-367, 1967.
[9] D. Bertsimas and J. Niño-Mora. Restless bandits, linear programming relaxations, and a primal-dual index heuristic. Operations Research, 48(1):80-90, 2000.
[10] O. Besbes, Y. Gur, and A. Zeevi. Stochastic multi-armed-bandit problem with non-stationary rewards. In Advances in Neural Information Processing Systems, volume 27, 2014.
[11] I. Bogunovic, J. Scarlett, and V. Cevher. Time-varying gaussian process bandit optimization. In Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, volume 51, pages 314-323. PMLR, 2016.
[12] Y. Cao, Z. Wen, B. Kveton, and Y. Xie. Nearly optimal adaptive procedure with change detection for piecewise-stationary bandit. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, volume 89 of PMLR, pages 418-427, 2019.
[13] L. Cella and N. Cesa-Bianchi. Stochastic bandits with delay-dependent payoffs. In International Conference on Artificial Intelligence and Statistics, pages 1168-1177. PMLR, 2020.
[14] V. Chavez-Demoulin and J. McGill. High-frequency financial data modeling using hawkes processes. Journal of Banking & Finance, 36(12):3415-3426, 2012.
[15] N. Chen, C. Wang, and L. Wang. Learning and optimization with seasonal patterns. arXiv preprint arXiv:2005.08088, 2020.
[16] V. Dani and T. P. Hayes. Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), page 937-943, 2006.
[17] H. A. David and H. N. Nagaraja. Order Statistics. Wiley, 2003.
[18] M. G. Dekimpe and D. M. Hanssens. The persistence of marketing effects on sales. Marketing science, 14(1):1-21, 1995.
[19] B. U. Devi, D. Sundar, and P. Alli. An effective time series analysis for stock trend prediction using arima model for nifty midcap-50. International Journal of Data Mining & Knowledge Management Process, 3(1):65, 2013.
[20] R. Durrett. Probability: Theory and Examples. Cambridge University Press, 5th edition, 2019.
[21] J. Fattah, L. Ezzine, Z. Aman, H. E. Moussami, and A. Lachhab. Forecasting of demand using arima model. International Journal of Engineering Business Management, 10, 2018.
[22] T. C. Gard. Introduction to Stochastic Differential Equations. Marcel Dekker, 1988.
[23] C. W. Gardiner. Handbook of stochastic methods: for the natural and social sciences. Springer, 2009.
[24] A. Garivier, T. Lattimore, and E. Kaufmann. On explore-then-commit strategies. In Advances in Neural Information Processing Systems, volume 29, 2016.
[25] A. Garivier and E. Moulines. On upper-confidence bound policies for switching bandit problems. In Algorithmic Learning Theory, pages 174-188. Springer Berlin Heidelberg, 2011.
[26] J. Gittins and D. Jones. A dynamic allocation index for the sequential design of experiments. In Progress in Statistics, pages 241-266. North-Holland, 1974.
[27] S. Grünewäder and A. Khaleghi. Approximations of the restless bandit problem. Journal of Machine Learning Research, 20(14):1-37, 2019.
[28] S. Guha and K. Munagala. Approximation algorithms for partial-information based stochastic control with markovian rewards. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), pages 483-493, 2007.