[23] P. Frazier, D. Kempe, J. M. Kleinberg, and R. Kleinberg. Incentivizing exploration. In ACM Conf. on Economics and Computation (ACM-EC), pages 5–22, 2014.
[24] D. Fudenberg and D. K. Levine. Learning with recency bias. Proceedings of the National Academy of Sciences, 111:10826-10829, 2014.
[25] D. Fudenberg, G. Lanzani, and P. Strack. Limit Points of Endogenous Misspecified Learning. Econometrica, 89(3):1065-1098, May 2021.
[26] I. Gilboa and D. Schmeidler. Case-Based Decision Theory. The Quarterly Journal of Economics, 110(3):605-639, 08 1995.
[27] B. Golub and E. D. Sadler. Learning in social networks. In Y. Bramouillé, A. Galeotti, and B. Rogers, editors, The Oxford Handbook of the Economics of Networks. Oxford University Press, 2016.
[28] F. Götze, H. Sambale, and A. Sinulis. Higher order concentration for functions of weakly dependent random variables. Electronic Journal of Probability, 24:1-19, 2019.
[29] L. Han, D. Kempe, and R. Qiang. Incentivizing exploration with heterogeneous value of money. In 11th Intl. Conf. on Web and Internet Economics (WINE), pages 370-383, 2015.
[30] J. M. Harrison, N. B. Keskin, and A. Zeevi. Bayesian dynamic pricing policies: Learning and earning under a binary prior distribution. Management Science, 58(3):570-586, 2012.
[31] P. Heidhues, B. Koszegi, and P. Strack. Unrealistic expectations and misguided learning. Econometrica, 86(4):1159-1214, 2018.
[32] W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American statistical association, 58(301):13-30, 1963.
[33] J. Horner and A. Skrzypacz. Learning, experimentation, and information design. In B. Honoré, A. Pakes, M. Piazzesi, and L. Samuelson, editors, Advances in Economics and Econometrics: 11th World Congress, volume 1, page 63-98. Cambridge University Press, 2017.
[34] N. Immorlica, J. Mao, A. Slivkins, and S. Wu. Incentivizing exploration with selective data disclosure. In ACM Conf. on Economics and Computation (ACM-EC), pages 647–648, 2020. Working paper available at https://arxiv.org/abs/1811.06026.
[35] M. Jedor, J. Louëdec, and V. Perchet. Be greedy in multi-armed bandits, 2021. Working paper, available on https://arxiv.org/abs/2101.01086.
[36] D. Kahneman and A. Tversky. Judgment under uncertainty: Heuristics and biases. Cambridge University Press, 1982.
[37] S. Kannan, J. Morgenstern, A. Roth, B. Waggoner, and Z. S. Wu. A smoothed analysis of the greedy algorithm for the linear contextual bandit problem. In Advances in Neural Information Processing Systems (NIPS), pages 2231-2241, 2018.
[38] E. Kaufmann, N. Korda, and R. Munos. Thompson sampling: An asymptotically optimal finite-time analysis. In 23rd Intl. Conf. on Algorithmic Learning Theory (ALT), pages 199-213, 2012.
[39] G. Keller, S. Rady, and M. Cripps. Strategic Experimentation with Exponential Bandits. Econometrica, 73(1):39-68, 2005.
[40] N. B. Keskin and A. Zeevi. On incomplete learning and certainty-equivalence control. Oper. Res., 66(4):1136-1167, 2018.
[41] I. Kremer, Y. Mansour, and M. Perry. Implementing the "wisdom of the crowd". J. of Political Economy, 122(5):988-1012, 2014. Preliminary version in ACM EC 2013.
[42] T. Lai and H. Robbins. Iterated least squares in multiperiod control. Advances in Applied Mathematics, 3(1):50-73, 1982.
[43] T. L. Lai and H. Robbins. Asymptotically efficient Adaptive Allocation Rules. Advances in Applied Mathematics, 6:4-22, 1985.
[44] G. Lanzani. Dynamic Concern for Misspecification, 2023. Working paper.
[45] T. Lattimore and C. Szepesvári. Bandit Algorithms. Cambridge University Press, Cambridge, UK, 2020.