| Bypassing the monster: A faster and simpler optimal algorithm for contextual bandits under realizability D Simchi-Levi, Y Xu Mathematics of Operations Research, 2022 | 118 | 2022 |
| Instance-dependent complexity of contextual bandits and reinforcement learning: A disagreement-based perspective DJ Foster, A Rakhlin, D Simchi-Levi, Y Xu Conference on Learning Theory, 2021 | 87 | 2021 |
| Offline reinforcement learning: Fundamental barriers for value function approximation DJ Foster, A Krishnamurthy, D Simchi-Levi, Y Xu Conference on Learning Theory, 2022 | 62 | 2022 |
| Online pricing with offline data: Phase transition and inverse square law J Bu, D Simchi-Levi, Y Xu Management Science 68 (12), 8515-9218, 2022 | 41 | 2022 |
| Phase transitions in bandits with switching constraints D Simchi-Levi, Y Xu Management Science 69 (12), 7151-7882, 2023 | 38* | 2023 |
| Assortment Optimization for a Multistage Choice Model Y Xu, Z Wang Manufacturing & Service Operations Management, 2023 | 16 | 2023 |
| Blind network revenue management and bandits with knapsacks under limited switches D Simchi-Levi, Y Xu, J Zhao arXiv preprint arXiv:1911.01067, 2019 | 7* | 2019 |
| Data-Driven Dynamic Decision Making: Algorithms, Structures, and Complexity Analysis Y Xu Massachusetts Institute of Technology, 2023 | 1 | 2023 |
