arxivMarch 31, 2026 at 4:00 AM1 min read

Water-Filling is Universally Minimax Optimal

arXiv:2603.26893v1 Announce Type: cross Abstract: 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, portfolio selection, signal processing, and many other areas. The wate

Read original article ↗

No replies yet. Be first.

arxiv4h ago

Advantage-Guided Diffusion for Model-Based Reinforcement Learning

arxiv4h ago

FluidFlow: a flow-matching generative model for fluid dynamics surrogates on unstructured meshes

arxiv4h ago

Water-Filling is Universally Minimax Optimal

Related Articles

Advantage-Guided Diffusion for Model-Based Reinforcement Learning

FluidFlow: a flow-matching generative model for fluid dynamics surrogates on unstructured meshes

HiL-Bench (Human-in-Loop Benchmark): Do Agents Know When to Ask for Help?