arxiv
PublishedMarch 31, 2026 at 4:00 AM
Water-Filling is Universally Minimax Optimal
Publisher summary· verbatim
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
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivDeepSWIP: Quotient-WMC Counterfactuals for Neural Probabilistic Logic Programs1darxivAI4SE and SE4AI Exploration: A Decade Looking Back and Forward1darxivExit-and-Join Dynamics for Decentralized Coalition Formation1darxivDeontic Policies for Runtime Governance of Agentic AI Systems1dThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗