Author of the publication

First Passage Percolation with Queried Hints.

, , , , , and . AISTATS, volume 238 of Proceedings of Machine Learning Research, page 4231-4239. PMLR, (2024)

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

Congested Bandits: Optimal Routing via Short-term Resets., , , and . CoRR, (2023)Contextual Recommendations and Low-Regret Cutting-Plane Algorithms., , , , , and . NeurIPS, page 22498-22508. (2021)Revenue Maximization in Transportation Networks., , and . APPROX-RANDOM, volume 207 of LIPIcs, page 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Congested Bandits: Optimal Routing via Short-term Resets., , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 1078-1100. PMLR, (2022)On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems., and . WINE, volume 11920 of Lecture Notes in Computer Science, page 200-213. Springer, (2019)Orienteering Algorithms for Generating Travel Itineraries., , , , , and . WSDM, page 180-188. ACM, (2018)Existence and Efficiency of Equilibria for Cost-Sharing in Generalized Weighted Congestion Games., , and . ACM Trans. Economics and Comput., 8 (2): 11:1-11:28 (2020)Arbitrary Profit Sharing in Federated Learning Utility Games., and . SAGT, volume 14238 of Lecture Notes in Computer Science, page 58-70. Springer, (2023)Online Learning and Bandits with Queried Hints., , , , and . ITCS, volume 251 of LIPIcs, page 16:1-16:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-Making., , and . AAAI, page 10030-10038. AAAI Press, (2024)