Huang, J., Dai, Y., and Huang, L. (2023). Banker online mirror descent: A universal approach for delayed online bandit learning. arXiv preprint arXiv:2301.10500.
Ito, S., Hatano, D., Sumita, H., Takemura, K., Fukunaga, T., Kakimura, N., and Kawarabayashi, K.-I. (2020). Delay and cooperation in nonstochastic linear bandits. Advances in Neural Information Processing Systems, 33:4872-4883.
Jin, C., Allen-Zhu, Z., Bubeck, S., and Jordan, M. I. (2018). Is q-learning provably efficient? Advances in neural information processing systems, 31.
Jin, C., Liu, Q., Wang, Y., and Yu, T. (2021). V-learning-a simple, efficient, decentralized algorithm for multiagent rl. arXiv preprint arXiv:2110.14555.
Jin, C., Liu, Q., and Yu, T. (2022a). The power of exploiter: Provable multi-agent rl in large state spaces. In International Conference on Machine Learning, pages 10251-10279. PMLR.
Jin, T., Lancewicki, T., Luo, H., Mansour, Y., and Rosenberg, A. (2022b). Near-optimal regret for adversarial mdp with delayed bandit feedback. arXiv preprint arXiv:2201.13172.
Jin, Y., Muthukumar, V., and Sidford, A. (2022c). The complexity of infinite-horizon general-sum stochastic games. arXiv preprint arXiv:2204.04186.
Joulani, P., Gyorgy, A., and Szepesvári, C. (2013). Online learning under delayed feedback. In International Conference on Machine Learning, pages 1453-1461. PMLR.
Kong, D., Salakhutdinov, R., Wang, R., and Yang, L. F. (2021). Online sub-sampling for reinforcement learning with general function approximation. arXiv preprint arXiv:2106.07203.
Lancewicki, T., Rosenberg, A., and Mansour, Y. (2022). Learning adversarial markov decision processes with delayed feedback. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 7281-7289.
Lancewicki, T., Segal, S., Koren, T., and Mansour, Y. (2021). Stochastic multi-armed bandits with unrestricted delay distributions. In International Conference on Machine Learning, pages 5969-5978. PMLR.
Lattimore, T. and Szepesvári, C. (2020). Bandit algorithms. Cambridge University Press.
Li, G., Chi, Y., Wei, Y., and Chen, Y. (2022). Minimax-optimal multi-agent rl in markov games with a generative model. In Advances in Neural Information Processing Systems.
Liu, Q., Yu, T., Bai, Y., and Jin, C. (2021). A sharp analysis of model-based reinforcement learning with self-play. In International Conference on Machine Learning, pages 7001-7010. PMLR.
Mahmood, A. R., Korenkevych, D., Komer, B. J., and Bergstra, J. (2018). Setting up a reinforcement learning task with a real-world robot. In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 4635-4640. IEEE.
Mao, W. and Basar, T. (2022). Provably efficient reinforcement learning in decentralized general-sum markov games. Dynamic Games and Applications, pages 1-22.
Nash, J. (1951). Non-cooperative games. The Annals of Mathematics, 54(2):286-295.
Perchet, V., Rigollet, P., Chassang, S., and Snowberg, E. (2016). Batched bandit problems. The Annals of Statistics, pages 660-681.
Qiao, D., Yin, M., Min, M., and Wang, Y.-X. (2022). Sample-efficient reinforcement learning with loglog (t) switching cost. arXiv preprint arXiv:2202.06385.
Quanrud, K. and Khashabi, D. (2015). Online learning with adversarial delays. Advances in neural information processing systems, 28.
Shapley, L. S. (1953). Stochastic games. Proceedings of the national academy of sciences, 39(10):1095-1100.