2 papers
cs.DS2026
Water-Filling is Universally Minimax Optimal
Siddhartha Banerjee, Ramiro N. Deo-Campo Vuong, Robert Kleinberg
Allocation of dynamically-arriving (i.e., online) divisible resources among a set of offline agents is a fundamental problem, with applications to online marketplaces, scheduling,…
math.OC2025
Sequential Fair Allocation With Replenishments: A Little Envy Goes An Exponentially Long Way
Chido Onyeze, Sean R. Sinclair, Chamsi Hssaine +1
We study the trade-off between envy and inefficiency in repeated resource allocation settings with stochastic replenishments, motivated by real-world systems such as food banks and…