| Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack∗ J Jiang, W Ma, J Zhang Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 33 | 2022 |
| Online stochastic optimization with wasserstein based non-stationarity J Jiang, X Li, J Zhang arXiv preprint arXiv:2012.06961, 2020 | 32 | 2020 |
| Achieving high individual service-levels without safety stock? optimal rationing policy of pooled resources J Jiang, S Wang, J Zhang Operations Research 71 (1), 358-377, 2023 | 26 | 2023 |
| Non-stationary Bandits with Knapsacks S Liu, J Jiang, X Li Advances in Neural Information Processing Systems, 2022 | 16 | 2022 |
| Learning to order for inventory systems with lost sales and uncertain supplies B Chen, J Jiang, J Zhang, Z Zhou Management Science, 2024 | 12 | 2024 |
| Online resource allocation with stochastic resource consumption J Jiang, J Zhang arXiv preprint arXiv:2012.07933, 2020 | 10 | 2020 |
| Degeneracy is ok: Logarithmic regret for network revenue management with indiscrete distributions J Jiang, W Ma, J Zhang arXiv preprint arXiv:2210.07996, 2022 | 8 | 2022 |
| Tightness without counterexamples: A new approach and new results for prophet inequalities J Jiang, W Ma, J Zhang arXiv preprint arXiv:2205.00588, 2022 | 7 | 2022 |
| Constant approximation for network revenue management with Markovian-correlated customer arrivals J Jiang arXiv preprint arXiv:2305.05829, 2023 | 3 | 2023 |
| Constrained online two-stage stochastic optimization: Algorithm with (and without) predictions P Hu, J Jiang, G Lyu, H Su arXiv preprint arXiv:2401.01077, 2024 | 1 | 2024 |
| High-dimensional Linear Bandits with Knapsacks W Ma, D Xia, J Jiang arXiv preprint arXiv:2311.01327, 2023 | 1 | 2023 |
| Achieving Sample Complexity for Constrained Markov Decision Process J Jiang, Y Ye arXiv preprint arXiv:2402.16324, 2024 | | 2024 |
