2025
A Learning-Augmented Approach to Online Allocation Problems
NeurIPS 2025poster
In online allocation problems, an algorithm must choose from a set of options at each step, where each option incurs a set of costs/rewards associated with a set of $d$ agents. The goal is to minimize/maximize a function of the accumulated costs/rewards assigned to the agents over the course of the…