Eric Balkanski

Yuri Faenza

Mathieu Kubik

Math. Program., July, 2024

Randomized Strategic Facility Location with Predictions.

[BibT_eX]

[DOI]

Vasilis Gkatzelis

Golnoosh Shahkarami

CoRR, 2024

Submodular Maximization in Exactly n Queries.

[BibT_eX]

[DOI]

Steven DiSilvio

Alan Kuhnle

CoRR, 2024

Online Mechanism Design with Predictions.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

An Algorithm for the Assignment Game Beyond Additive Valuations.

[BibT_eX]

[DOI]

Christopher En

Yuri Faenza

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2023

Mechanism Design with Predictions: An Annotated Reading List.

[BibT_eX]

[DOI]

Vasilis Gkatzelis

Xizhi Tan

SIGecom Exch., 2023

Learning-Augmented Dynamic Submodular Maximization.

[BibT_eX]

[DOI]

Arpit Agarwal

CoRR, 2023

Scheduling with Speed Predictions.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

The Power of Greedy for Online Minimum Cost Matching on the Line.

[BibT_eX]

[DOI]

Yuri Faenza

Noémie Périvier

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Energy-Efficient Scheduling with Predictions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Strategyproof Scheduling with Predictions.

[BibT_eX]

[DOI]

Vasilis Gkatzelis

Xizhi Tan

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

The Limitations of Optimization from Samples.

[BibT_eX]

[DOI]

J. ACM, 2022

An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model.

[BibT_eX]

[DOI]

Oper. Res., 2022

Deterministic Budget-Feasible Clock Auctions.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Learning Low Degree Hypergraphs.

[BibT_eX]

[DOI]

Oussama Hanguir

Shatian Wang

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Robust Repeated First Price Auctions.

[BibT_eX]

[DOI]

Shipra Agrawal

Vahab S. Mirrokni

Balasubramanian Sivan

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Instance Specific Approximations for Submodular Maximization.

[BibT_eX]

[DOI]

Sharon Qian

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

On the Construction of Substitutes.

[BibT_eX]

[DOI]

Renato Paes Leme

Math. Oper. Res., 2020

Adversarial Attacks on Binary Image Recognition Systems.

[BibT_eX]

[DOI]

CoRR, 2020

A lower bound for parallel submodular minimization.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

The Adaptive Complexity of Maximizing a Gross Substitutes Valuation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

The FAST Algorithm for Submodular Maximization.

[BibT_eX]

[DOI]

Adam Breuer

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Dynamic First Price Auctions Robust to Heterogeneous Buyers.

[BibT_eX]

[DOI]

Shipra Agrawal

Vahab S. Mirrokni

Balasubramanian Sivan

CoRR, 2019

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Secretary Ranking with Minimal Inversions.

[BibT_eX]

[DOI]

Sepehr Assadi

Renato Paes Leme

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization.

[BibT_eX]

[DOI]

CoRR, 2018

The adaptive complexity of maximizing a submodular function.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Non-monotone Submodular Maximization in Exponentially Fewer Iterations.

[BibT_eX]

[DOI]

Adam Breuer

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning to Optimize Combinatorial Functions.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Approximation Guarantees for Adaptive Sampling.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Statistical Cost Sharing.

[BibT_eX]

[DOI]

Umar Syed

Sergei Vassilvitskii

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Minimizing a Submodular Function from Samples.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

The Importance of Communities for Learning to Influence.

[BibT_eX]

[DOI]

Nicole Immorlica

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

The Sample Complexity of Optimizing a Convex Function.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Bayesian Budget Feasibility with Posted Pricing.

[BibT_eX]

[DOI]

Jason D. Hartline

Proceedings of the 25th International Conference on World Wide Web, 2016

The Power of Optimization from Samples.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization.

[BibT_eX]

[DOI]

Baharan Mirzasoleiman

Andreas Krause

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

On the state complexity of partial word DFAs.

[BibT_eX]

[DOI]

Francine Blanchet-Sadri

Matthew Kilgore

Benjamin J. Wyatt

Theor. Comput. Sci., 2015

Mechanisms for Fair Attribution.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014

Simultaneous Cake Cutting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Partial Word DFAs.

[BibT_eX]

[DOI]