Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare., , , , , and . WINE, volume 11920 of Lecture Notes in Computer Science, page 129-141. Springer, (2019)Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts., , , and . Algorithmica, 82 (1): 64-87 (2020)Online Resource Allocation with Matching Constraints., , , , , and . AAMAS, page 1681-1689. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Algorithms to Approximate Column-Sparse Packing Problems., , , and . CoRR, (2017)Sequential Decision Making with Limited Resources.. University of Maryland, College Park, MD, USA, (2019)base-search.net (ftunivmaryland:oai:drum.lib.umd.edu:1903/25039).Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals., , , and . AAMAS, page 318-326. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Adversarial Bandits with Knapsacks., , , and . CoRR, (2018)The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descent., , , , and . CoRR, (2019)Algorithms to Approximate Column-sparse Packing Problems., , , and . ACM Trans. Algorithms, 16 (1): 10:1-10:32 (2020)New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching., , , and . ESA, volume 57 of LIPIcs, page 24:1-24:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)