Author of the publication

k-Center Clustering Under Perturbation Resilience.

, , and . ICALP, volume 55 of LIPIcs, page 68:1-68:14. 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

Monitoring stealthy diffusion., , , , and . Knowl. Inf. Syst., 52 (3): 657-685 (2017)Oracle-Efficient Learning and Auction Design., , , , , and . CoRR, (2016)Oracle-efficient Online Learning and Auction Design., , , , , and . J. ACM, 67 (5): 26:1-26:57 (2020)Smooth Nash Equilibria: Algorithms and Complexity., , , and . ITCS, volume 287 of LIPIcs, page 37:1-37:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Competition, Alignment, and Equilibria in Digital Marketplaces., , and . AAAI, page 5689-5696. AAAI Press, (2023)Smoothed Analysis with Adaptive Adversaries., , and . J. ACM, 71 (3): 19 (June 2024)Can Probabilistic Feedback Drive User Impacts in Online Platforms?, , , , and . AISTATS, volume 238 of Proceedings of Machine Learning Research, page 2512-2520. PMLR, (2024)Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries., , , , , and . Operations Research, 68 (1): 16-34 (2020)Lazy Defenders Are Almost Optimal against Diligent Attackers., , and . AAAI, page 573-579. AAAI Press, (2014)On-Demand Sampling: Learning Optimally from Multiple Distributions., , and . NeurIPS, (2022)