Abbasi-Yadkori, Y., Pál, D., and Szepesváři, C. (2011). Improved algorithms for linear stochastic bandits. Advances in neural information processing systems, 24.
Agarwal, A. and Duchi, J. C. (2011). Distributed delayed stochastic optimization. Advances in neural information processing systems, 24.
Azar, M. G., Osband, I., and Munos, R. (2017). Minimax regret bounds for reinforcement learning. In International Conference on Machine Learning, pages 263-272. PMLR.
Bai, Y. and Jin, C. (2020). Provable self-play algorithms for competitive reinforcement learning. In International conference on machine learning, pages 551-560. PMLR.
Bai, Y., Jin, C., and Yu, T. (2020). Near-optimal reinforcement learning with self-play. Advances in neural information processing systems, 33:2159-2170.
Bistritz, I., Zhou, Z., Chen, X., Bambos, N., and Blanchet, J. (2019). Online exp3 learning in adversarial bandits with delayed feedback. Advances in neural information processing systems, 32.
Cesa-Bianchi, N., Dekel, O., and Shamir, O. (2013). Online learning with switching costs and other adaptive adversaries. Advances in Neural Information Processing Systems, 26.
Changuel, N., Sayadi, B., and Kieffer, M. (2012). Online learning for qoe-based video streaming to mobile receivers. In 2012 IEEE Globecom Workshops, pages 1319-1324. IEEE.
Chen, B., Xu, M., Liu, Z., Li, L., and Zhao, D. (2020). Delay-aware multi-agent reinforcement learning for cooperative and competitive environments. arXiv preprint arXiv:2005.05441.
Chen, Z., Zhou, D., and Gu, Q. (2021). Almost optimal algorithms for two-player markov games with linear function approximation. arXiv preprint arXiv:2102.07404.
Cui, Q. and Du, S. S. (2022a). Provably efficient offline multi-agent reinforcement learning via strategy-wise bonus. arXiv preprint arXiv:2206.00159.
Cui, Q. and Du, S. S. (2022b). When is offline two-player zero-sum markov game solvable? arXiv preprint arXiv:2201.03522.
Daskalakis, C., Golowich, N., and Zhang, K. (2022). The complexity of markov equilibrium in stochastic games. arXiv preprint arXiv:2204.03991.
Dudik, M., Hsu, D., Kale, S., Karampatziakis, N., Langford, J., Reyzin, L., and Zhang, T. (2011). Efficient optimal learning for contextual bandits. arXiv preprint arXiv:1106.2369.
Gael, M. A., Vernade, C., Carpentier, A., and Valko, M. (2020). Stochastic bandits with arm-dependent delays. In International Conference on Machine Learning, pages 3348-3356. PMLR.
Gao, M., Xie, T., Du, S. S., and Yang, L. F. (2021). A provably efficient algorithm for linear markov decision process with low switching cost. arXiv preprint arXiv:2101.00494.
Gao, Z., Han, Y., Ren, Z., and Zhou, Z. (2019). Batched multi-armed bandits problem. Advances in Neural Information Processing Systems, 32.
Gyorgy, A. and Joulani, P. (2021). Adapting to delays and data in adversarial multi-armed bandits. In International Conference on Machine Learning, pages 3988-3997. PMLR.
Howson, B., Pike-Burke, C., and Filippi, S. (2021). Delayed feedback in episodic reinforcement learning. arXiv preprint arXiv:2111.07615.
Howson, B., Pike-Burke, C., and Filippi, S. (2022). Delayed feedback in generalised linear bandits revisited. arXiv preprint arXiv:2207.10786.
Huang, B., Lee, J. D., Wang, Z., and Yang, Z. (2021). Towards general function approximation in zero-sum markov games. arXiv preprint arXiv:2107.14702.