Karthik Abinav Sankararaman
Karthik Abinav Sankararaman
Facebook, University of Maryland, College Park
Verified email at fb.com - Homepage
Title
Cited by
Cited by
Year
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
39*2016
Allocation problems in ride-sharing platforms: Online matching with offline reusable resources
JP Dickerson, KA Sankararaman, A Srinivasan, P Xu
Proc. Thirty-Second AAAI Conference on Artificial Intelligence (AAAI), 2018
312018
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
23*2020
Adversarial bandits with knapsacks
N Immorlica, KA Sankararaman, R Schapire, A Slivkins
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
222019
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
212014
Combinatorial semi-bandits with knapsacks
KA Sankararaman, A Slivkins
International Conference on Artificial Intelligence and Statistics, 1760--1770, 2018
172018
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
152018
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
B Brubach, KA Sankararaman, A Srinivasan, P Xu
Algorithmica 82 (1), 64-87, 2020
92020
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, 1877-1884, 2019
92019
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
52019
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours
V Nanda, P Xu, KA Sankararaman, JP Dickerson, A Srinivasan
Proc. Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI), 2020
32020
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
32020
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
32019
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, 2221-2228, 2019
22019
Stability of linear structural equation models of causal inference
KA Sankararaman, A Louis, N Goyal
Uncertainty in Artificial Intelligence, 323-333, 2019
22019
Semi-Bandit feedback: A survey of results
KA Sankararaman
University of Maryland, College Park, 2016
1*2016
A Revocable Online-Offline Certificateless Signature Scheme without Pairing.
K Abinav, S Badrinarayanan, CP Rangan, SSD Selvi, SS Vivek, ...
IACR Cryptol. ePrint Arch. 2013, 758, 2013
12013
Multi-armed Bandits with Cost Subsidy
D Sinha, KA Sankararama, A Kazerouni, V Avadhanula
arXiv preprint arXiv:2011.01488, 2020
2020
Improved Approximation Algorithms for Stochastic-Matching Problems
M Adamczyk, B Brubach, F Grandoni, KA Sankararaman, A Srinivasan, ...
arXiv preprint arXiv:2010.08142, 2020
2020
Robust Identifiability in Linear Structural Equation Models of Causal Inference
KA Sankararaman, A Louis, N Goyal
arXiv preprint arXiv:2007.06869, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20