| Capacity constrained assortment optimization under the markov chain based choice model A Désir, V Goyal, D Segev, C Ye Available at SSRN 2626484, 2015 | 128* | 2015 |
| Cake cutting algorithms for piecewise constant and piecewise uniform valuations H Aziz, C Ye International conference on web and internet economics, 1-14, 2014 | 67 | 2014 |
| ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems CY Bharathan Balaji, Jordan Bell-Masterson, Enes Bilgin, Andreas Damianou ... https://arxiv.org/abs/1911.10641, 2019 | 42* | 2019 |
| Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs I Feigenbaum, J Sethuraman, C Ye Mathematics of Operations Research 42 (2), 434-447, 2017 | 31 | 2017 |
| Reinforcement learning P Bajaj GeeksForGeeks. org [online],[retrieved on Mar. 4, 2020], Retrieved from the …, 2023 | 26 | 2023 |
| Ex post Efficiency of Random Assignments. H Aziz, S Mackenzie, L Xia, C Ye AAMAS, 1639-1640, 2015 | 22 | 2015 |
| Approximation algorithms for the incremental knapsack problem via disjunctive programming D Bienstock, J Sethuraman, C Ye arXiv preprint arXiv:1311.4563, 2013 | 13 | 2013 |
| A note on the assignment problem with uniform preferences J Sethuraman, C Ye Operations Research Letters 43 (3), 283-287, 2015 | 6 | 2015 |
| On the trade-offs between modeling power and algorithmic complexity C Ye Columbia University, 2016 | 4 | 2016 |
| Rigidity of Graph Joins and Hendrickson's Conjecture T Sun, C Ye arXiv preprint arXiv:1011.3208, 2010 | 1 | 2010 |
Haris AzizUNSW Sydney - Scientia Associate Professor在 unsw.edu.au 的电子邮件经过验证
