| Algorithms for trip-vehicle assignment in ride-sharing X Bei, S Zhang Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 162 | 2018 |
| The price of fairness for indivisible goods X Bei, X Lu, P Manurangsi, W Suksompong International Joint Conference on Artificial Intelligence (IJCAI), 2019 | 110 | 2019 |
| Optimal proportional cake cutting with connected pieces X Bei, N Chen, X Hua, B Tao, E Yang Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 1263-1269, 2012 | 98 | 2012 |
| Balancing efficiency and fairness in on-demand ridesourcing NS Lesmana, X Zhang, X Bei Advances in Neural Information Processing Systems, 5309-5319, 2019 | 89 | 2019 |
| Budget feasible mechanism design: from prior-free to bayesian X Bei, N Chen, N Gravin, P Lu Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 89 | 2012 |
| Bayesian incentive compatibility via fractional assignments X Bei, Z Huang Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 87 | 2011 |
| Fair division of mixed divisible and indivisible goods X Bei, Z Li, J Liu, S Liu, X Lu Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1814-1821, 2020 | 67 | 2020 |
| The price of connectivity in fair division X Bei, A Igarashi, X Lu, W Suksompong Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5151-5158, 2021 | 62 | 2021 |
| Correlation-robust analysis of single item auction X Bei, N Gravin, P Lu, ZG Tang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 46 | 2019 |
| Networked fairness in cake cutting X Bei, Y Qiao, S Zhang International Joint Conference on Artificial Intelligence (IJCAI), 2017 | 46 | 2017 |
| On the complexity of trial and error X Bei, N Chen, S Zhang Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 42 | 2013 |
| Cake Cutting: Envy and Truth. X Bei, N Chen, G Huzhang, B Tao, J Wu International Joint Conference on Artificial Intelligence (IJCAI), 3625-3631, 2017 | 39 | 2017 |
| Truthful fair division without free disposal X Bei, G Huzhang, W Suksompong Social Choice and Welfare 55 (3), 523-545, 2020 | 38 | 2020 |
| Ascending-price algorithms for unknown markets X Bei, J Garg, M Hoefer ACM Conference on Economics and Computation (EC) 2016, 699-699, 2016 | 38* | 2016 |
| Candidate Selections with Proportional Fairness Constraints X Bei, S Liu, CK Poon, H Wang Proceedings of the 19th International Conference on Autonomous Agents and …, 2020 | 35 | 2020 |
| Ascending-price algorithms for unknown markets X Bei, J Garg, M Hoefer ACM Transactions on Algorithms (TALG) 15 (3), 1-33, 2019 | 34 | 2019 |
| Maximin fairness with mixed divisible and indivisible goods X Bei, S Liu, X Lu, H Wang Autonomous Agents and Multi-Agent Systems 35 (2), 34, 2021 | 32 | 2021 |
| Truthful cake sharing X Bei, X Lu, W Suksompong Social Choice and Welfare 64 (1), 309-343, 2025 | 28 | 2025 |
| Dividing a graphical cake X Bei, W Suksompong Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5159-5166, 2021 | 27 | 2021 |
| Worst-case mechanism design via bayesian analysis X Bei, N Chen, N Gravin, P Lu SIAM Journal on Computing 46 (4), 1428-1448, 2017 | 25 | 2017 |
Warut SuksompongNational University of SingaporeVerified email at comp.nus.edu.sg
