23 citations · 48 across the 24 of their papers we have counts for
5 papers · 1 filter
Load Balancing with Duration Predictions
Yossi Azar, Niv Buchbinder, Tomer Epshtein
We study the classic fully dynamic load balancing problem on unrelated machines where jobs arrive and depart over time and the goal is minimizing the maximum load, or more generall…
Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
Niv Buchbinder, Joseph, Naor +1
We introduce the \emph{submodular objectives chasing problem}, which generalizes many natural and previously-studied problems: a sequence of constrained submodular maximization pro…
Trading Prophets with Initial Capital
Yossi Azar, Niv Buchbinder, Roie Levin +1
Correa et al. [EC' 2023] introduced the following trading prophets problem. A trader observes a sequence of stochastic prices for a stock, each drawn from a known distribution, and…
Competitively Consistent Clustering
Niv Buchbinder, Roie Levin, Yue Yang
In fully-dynamic consistent clustering, we are given a finite metric space , and a set of possible locations for opening centers. Data points arrive and depar…
Competitive Bundle Trading
Yossi Azar, Niv Buchbinder, Roie Levin +1
A retailer is purchasing goods in bundles from suppliers and then selling these goods in bundles to customers; her goal is to maximize profit, which is the revenue obtained from se…