Author of the publication

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier.

, , and . SODA, page 653-661. SIAM, (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. 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

Bounding Singular Values of Convolution Layers., and . CoRR, (2019)Battery provisioning and scheduling for a hybrid battery-diesel generator system., , and . SIGMETRICS Perform. Evaluation Rev., 41 (3): 71-76 (2013)Understanding Impacts of High-Order Loss Approximations and Features in Deep Learning Interpretation., , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 5848-5856. PMLR, (2019)Bandit Algorithms for Prophet Inequality and Pandora's Box., , , and . CoRR, (2022)Data-Centric Debugging: mitigating model failures via targeted data collection., , , and . CoRR, (2022)Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier., , and . SODA, page 653-661. SIAM, (2021)Morphing Planar Graph Drawings with a Polynomial Number of Steps., , , , , , , , , and . SODA, page 1656-1667. SIAM, (2013)Efficient Approximation Schemes for Stochastic Probing and Prophet Problems., and . EC, page 793-794. ACM, (2021)Salient ImageNet: How to discover spurious features in Deep Learning?, and . ICLR, OpenReview.net, (2022)Online Carpooling Using Expander Decompositions., , , and . FSTTCS, volume 182 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)