Online Resource Allocation

Ask about this topic

Overview

Online resource allocation asks how to commit limited resources to requests that arrive over time, when future demand and rewards may be unknown. Methods include linear-programming and primal-dual pricing, threshold and greedy policies, and learning approaches such as bandits and reinforcement learning; applications range from inventory and queues to cloud and language-model serving. The goal is often to maximize welfare or revenue while respecting capacity, budget, deadline, or fairness constraints. Theory can provide constant or sublinear regret under suitable assumptions, but handling nonstationary demand, degenerate constraints, unreliable predictions, and hard feasibility guarantees together remains challenging.

Latest papers

CardsList

96 papers9 papers in the last four weeks, up 13% on the four weeks before. 0.1% of all new papers.

  1. Power- and Fragmentation-aware Online Scheduling for GPU Datacenters

    Dec 23, 2024Francesco Lettich, Emanuele Carlini, Franco Maria Nardini +2Online Resource AllocationData Center Energy Management

    Istituto di Scienza e Tecnologie dell’Informazione “Alessandro Faedo”, Consiglio Nazionale delle Ricerche, Pisa, Italy

  2. Allocation Stability and Wald Inference under Variance-Aware UCB

    Dec 12, 2024Yingying Fan, Yuxuan Han, Jinchi Lv +2Multi-Armed BanditsUCB Algorithms

    Data Sciences and Operations Department University of Southern California Los Angeles, CA 90089, USA · Stern School of Business, New York University, New York, NY 10003, USA

  3. Infrequent Resolving Algorithm for Online Linear Programming

    Aug 1, 2024Guokai Li, Zizhuo Wang, Jingwei ZhangSequential Decision MakingRegret Minimization

    School of Data Science, The Chinese University of Hong Kong, Shenzhen, Guangdong, 518172, P.R. China

  4. Online Linear Programming with Batching

    Aug 1, 2024Haoran Xu, Peter W. Glynn, Yinyu YeSequential Decision MakingRegret Minimization

    Department of Management Science and Engineering, Stanford University

  5. Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards

    Dec 13, 2021Jung-hun Kim, Milan VojnovicMulti-Armed BanditsOnline Resource Allocation

    CREST, ENSAE Paris, France · London School of Economics, United Kingdom

  6. Equity Promotion in Online Resource Allocation

    Dec 8, 2021Pan Xu, Yifan XuSequential Decision MakingFair Resource Allocation

    Department of Computer Science, New Jersey Institute of Technology, Newark, USA · Key Lab of CNII, MOE, Southeast University, Nanjing, China