| Allocation problems in ride-sharing platforms: Online matching with offline reusable resources JP Dickerson, KA Sankararaman, A Srinivasan, P Xu ACM Transactions on Economics and Computation (TEAC) 9 (3), 1-17, 2021 | 106 | 2021 |
| The impact of neural network overparameterization on gradient confusion and stochastic gradient descent KA Sankararaman, S De, Z Xu, WR Huang, T Goldstein Thirty-seventh International Conference on Machine Learning (ICML), 2020 | 90* | 2020 |
| Adversarial bandits with knapsacks N Immorlica, K Sankararaman, R Schapire, A Slivkins Journal of the ACM 69 (6), 1-47, 2022 | 80 | 2022 |
| New algorithms, better bounds, and a novel model for online stochastic matching B Brubach, KA Sankararaman, A Srinivasan, P Xu 24th Annual European Symposium on Algorithms (ESA 2016), 2016 | 75* | 2016 |
| Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours V Nanda, P Xu, KA Sankararaman, J Dickerson, A Srinivasan Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 2210-2217, 2020 | 49 | 2020 |
| Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours V Nanda, P Xu, KA Sankararaman, JP Dickerson, A Srinivasan Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, 2020 | 49 | 2020 |
| Assigning tasks to workers based on historical data: Online task assignment with two-sided arrivals JP Dickerson, KA Sankararaman, A Srinivasan, P Xu International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2018 | 45 | 2018 |
| Combinatorial semi-bandits with knapsacks KA Sankararaman, A Slivkins International Conference on Artificial Intelligence and Statistics, 1760--1770, 2018 | 40 | 2018 |
| Ensuring privacy in location-based services: An approach based on opacity enforcement YC Wu, KA Sankararaman, S Lafortune IFAC Proceedings Volumes 47 (2), 33-38, 2014 | 37 | 2014 |
| Dominate or delete: Decentralized competing bandits in serial dictatorship A Sankararaman, S Basu, KA Sankararaman International Conference on Artificial Intelligence and Statistics, 1252-1260, 2021 | 29* | 2021 |
| Balancing relevance and diversity in online bipartite matching via submodularity JP Dickerson, KA Sankararaman, A Srinivasan, P Xu Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1877-1884, 2019 | 28 | 2019 |
| Attenuate locally, win globally: Attenuation-based frameworks for online stochastic matching with timeouts B Brubach, KA Sankararaman, A Srinivasan, P Xu Algorithmica 82, 64-87, 2020 | 25 | 2020 |
| Online resource allocation with matching constraints J Dickerson, K Sankararaman, K Sarpatwar, A Srinivasan, KL Wu, P Xu International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2019 | 21 | 2019 |
| Beyond regret for decentralized bandits in matching markets S Basu, KA Sankararaman, A Sankararaman International Conference on Machine Learning, 705-715, 2021 | 20 | 2021 |
| Stochastic bandits for multi-platform budget optimization in online advertising V Avadhanula, R Colini Baldeschi, S Leonardi, KA Sankararaman, ... Proceedings of the Web Conference 2021, 2805-2817, 2021 | 16 | 2021 |
| Multi-armed bandits with cost subsidy D Sinha, KA Sankararaman, A Kazerouni, V Avadhanula International Conference on Artificial Intelligence and Statistics, 3016-3024, 2021 | 15 | 2021 |
| Matching algorithms for blood donation DC McElfresh, C Kroer, S Pupyrev, E Sodomka, KA Sankararaman, ... Proceedings of the 21st ACM Conference on Economics and Computation, 463-464, 2020 | 13 | 2020 |
| Bandits with knapsacks beyond the worst case KA Sankararaman, A Slivkins Advances in Neural Information Processing Systems 34, 23191-23204, 2021 | 11* | 2021 |
| A unified approach to online matching with conflict-aware constraints P Xu, Y Shi, H Cheng, J Dickerson, KA Sankararaman, A Srinivasan, ... Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2221-2228, 2019 | 10 | 2019 |
| Algorithms to approximate column-sparse packing problems B Brubach, KA Sankararaman, A Srinivasan, P Xu ACM Transactions on Algorithms (TALG) 16 (1), 1-32, 2019 | 8 | 2019 |
Pan XuDepartment of Computer Science, New Jersey Institute of TechnologyVerified email at njit.edu
