1. Agrawal, S., Goyal, N.: Further optimal regret bounds for Thompson sampling. In: Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, vol. 31, pp. 99–107. PMLR (2013)
2. Amin, K., Rostamizadeh, A., Syed, U.: Learning prices for repeated auctions with strategic buyers. In: Proceedings of the 26th International Conference on Neural Information Processing Systems, pp. 1169–1177. Curran Associates Inc. (2013)
3. Amin, K., Rostamizadeh, A., Syed, U.: Repeated contextual auctions with strategic buyers. Adv. Neural Inf. Process. Syst. 27, 622–630 (2014)
4. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48–77 (2002)
5. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235–256 (2002). https://doi.org/10.1023/A:1013689704352