activity
20152026
most citedNon-monotone Submodular Maximization in Exponentially Fewer Iterations

17 citations · 65 across the 26 of their papers we have counts for

collaborators

28 papers

cs.DS2026

A Consistency-Robustness Framework for Robust Optimization: Integrating Predictions into Robust Scheduling

Yasser Alghouass, Eric Balkanski, Vineet Goyal +1

Robust optimization protects against uncertainty by optimizing for the worst case over a prescribed uncertainty set. This protection can be overly conservative when forecasts, hist…

cs.DS2026

On the Average-Case Performance of Greedy for Maximum Coverage

Eric Balkanski, Jason Chatzitheodorou, Flore Sentenac

For the classical maximum coverage problem, the greedy algorithm achieves a worst-case approximation, which is optimal unless . The notion of coverage…

cs.GT2024

Randomized Strategic Facility Location with Predictions

Eric Balkanski, Vasilis Gkatzelis, Golnoosh Shahkarami

In the strategic facility location problem, a set of agents report their locations in a metric space and the goal is to use these reports to open a new facility, minimizing an aggr…

cs.DM2024

An Algorithm for the Assignment Game Beyond Additive Valuations

Eric Balkanski, Christopher En, Yuri Faenza

The assignment game, introduced by Shapley and Shubik (1971), is a classic model for two-sided matching markets between buyers and sellers. In the original assignment game, it is a…

cs.DS2024

Submodular Maximization in Exactly Queries

Eric Balkanski, Steven DiSilvio, Alan Kuhnle +1

In this work, we study the classical problem of maximizing a submodular function subject to a matroid constraint. We develop deterministic algorithms that are very parsimonious wit…

cs.DS2024★ 1 cited

Energy-Efficient Scheduling with Predictions

Eric Balkanski, Noemie Perivier, Clifford Stein +1

An important goal of modern scheduling systems is to efficiently manage power usage. In energy-efficient scheduling, the operating system controls the speed at which a machine is p…