Author of the publication

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)

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

Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach., , , , , and . AAAI, page 2245-2252. AAAI Press, (2019)Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs., , , and . AAAI, page 12956-12964. AAAI Press, (2024)A Finite-Time Analysis of Q-Learning with Neural Network Function Approximation., and . ICML, volume 119 of Proceedings of Machine Learning Research, page 10555-10565. PMLR, (2020)Allocation Problem in Remote Teleoperation: Online Matching with Offline Reusable Resources and Delayed Assignments., , , , , and . AAMAS, page 513-521. ACM, (2023)Stochastic Gradient Hamiltonian Monte Carlo Methods with Recursive Variance Reduction., , and . NeurIPS, page 3830-3841. (2019)Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization., , , and . NeurIPS, page 3126-3137. (2018)Fairness Maximization among Offline Agents in Online-Matching Markets., , and . ACM Trans. Economics and Comput., 10 (4): 16:1-16:27 (December 2022)A Hierarchical Spatial-Temporal Cross-Attention Scheme for Video Summarization Using Contrastive Learning., , , , , , and . Sensors, 22 (21): 8275 (2022)Algorithms to Approximate Column-Sparse Packing Problems., , , and . SODA, page 311-330. SIAM, (2018)Two-Sided Capacitated Submodular Maximization in Gig Platforms.. WINE, volume 14413 of Lecture Notes in Computer Science, page 600-617. Springer, (2023)