Author of the publication

Online Random Sampling for Budgeted Settings.

, , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 29-40. Springer, (2017)

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

Platform Behavior under Market Shocks: A Simulation Framework and Reinforcement-Learning Based Study., , , , , , and . WWW, page 3592-3602. ACM, (2023)Online Random Sampling for Budgeted Settings., , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 29-40. Springer, (2017)Truthful Prompt Scheduling for Minimizing Sum of Completion Times., , , and . ESA, volume 112 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Pricing Online Decisions: Beyond Auctions., , , and . SODA, page 73-91. SIAM, (2015)On the Power and Limits of Dynamic Pricing in Combinatorial Markets., , and . WINE, volume 12495 of Lecture Notes in Computer Science, page 206-219. Springer, (2020)Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue., , , , and . EC, page 19-20. ACM, (2019)Dynamic Pricing of Servers on Trees., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 10:1-10:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Interdependent Values without Single-Crossing., , , and . EC, page 369. ACM, (2018)Reinforcement Learning of Sequential Price Mechanisms., , , , and . AAAI, page 5219-5227. AAAI Press, (2021)A Simple and Approximately Optimal Mechanism for a Buyer with Complements: Abstract., , , , and . EC, page 323. ACM, (2017)