From post

Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship.

, , и . AISTATS, том 130 из Proceedings of Machine Learning Research, стр. 1252-1260. PMLR, (2021)

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.

 

Другие публикации лиц с тем же именем

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts., , , и . Algorithmica, 82 (1): 64-87 (2020)Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare., , , , , и . WINE, том 11920 из Lecture Notes in Computer Science, стр. 129-141. Springer, (2019)Algorithms to Approximate Column-Sparse Packing Problems., , , и . CoRR, (2017)Online Resource Allocation with Matching Constraints., , , , , и . AAMAS, стр. 1681-1689. International Foundation for Autonomous Agents and Multiagent Systems, (2019)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., , , и . AAMAS, стр. 318-326. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources., , , и . ACM Trans. Economics and Comput., 9 (3): 13:1-13:17 (2021)Online minimum matching with uniform metric and random arrivals., , и . Oper. Res. Lett., 50 (1): 45-49 (2022)Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity., , , и . AAAI, стр. 1877-1884. AAAI Press, (2019)Matching Algorithms for Blood Donation., , , , , , , и . EC, стр. 463-464. ACM, (2020)