AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Online Learning for Load Balancing of Unknown Monotone Resource Allocation Games

Ilai Bistritz, Nicholas Bambos

ICML 2021 · Bandits and online learning › Online convex optimization and games · approach: Last-iterate convergence in games

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Adding online pricing-coefficient adjustment (manager updates alpha using total load feedback) versus uncontrolled NEPower control game · Power control (N=300, K=3)total throughput: 1184.9 vs 1027.8 at t=750Improved
Adding online pricing-coefficient adjustment versus uncontrolled NEDemand-side management game · DSM (N=1000, K=24)social welfare: 744.7 vs 208.9 at t=100Improved
Adding online pricing-coefficient adjustment versus the Grammatico (2017) controllerAggregative game with 2 resources · Comparison with Grammatico 2017 (N=1000, K=2)convergence time and social welfareNo clear effect
Adding the manager's pricing update (vs. Grammatico 2017) in terms of load overshootAggregative game with 2 resources · Comparison with Grammatico 2017 (N=1000, K=2)total load overshootImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy