Eric Balkanski

Orcid: 0000-0001-6876-7919

According to our database1, Eric Balkanski authored at least 38 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Learning-Augmented Dynamic Submodular Maximization.
CoRR, 2023

Online Mechanism Design with Predictions.
CoRR, 2023

Scheduling with Speed Predictions.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

The Power of Greedy for Online Minimum Cost Matching on the Line.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Energy-Efficient Scheduling with Predictions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Strategyproof Scheduling with Predictions.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
The Limitations of Optimization from Samples.
J. ACM, 2022

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

Deterministic Budget-Feasible Clock Auctions.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

The Simultaneous Semi-random Model for TSP.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

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

2021
Robust Repeated First Price Auctions.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Instance Specific Approximations for Submodular Maximization.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
On the Construction of Substitutes.
Math. Oper. Res., 2020

Adversarial Attacks on Binary Image Recognition Systems.
CoRR, 2020

A lower bound for parallel submodular minimization.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

The Adaptive Complexity of Maximizing a Gross Substitutes Valuation.
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.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Dynamic First Price Auctions Robust to Heterogeneous Buyers.
CoRR, 2019

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Secretary Ranking with Minimal Inversions.
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.
CoRR, 2018

The adaptive complexity of maximizing a submodular function.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Non-monotone Submodular Maximization in Exponentially Fewer Iterations.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning to Optimize Combinatorial Functions.
Proceedings of the 35th International Conference on Machine Learning, 2018

Approximation Guarantees for Adaptive Sampling.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Statistical Cost Sharing.
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.
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.
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.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Bayesian Budget Feasibility with Posted Pricing.
Proceedings of the 25th International Conference on World Wide Web, 2016

The Power of Optimization from Samples.
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.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
On the state complexity of partial word DFAs.
Theor. Comput. Sci., 2015

Mechanisms for Fair Attribution.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
Simultaneous Cake Cutting.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Partial Word DFAs.
Proceedings of the Implementation and Application of Automata, 2013


  Loading...