Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems

10 Mar 2019 Devanur Nikhil R. Jain Kamal Sivan Balasubramanian Wilkens Christopher A.

We present prior robust algorithms for a large class of resource allocation problems where requests arrive one-by-one (online), drawn independently from an unknown distribution at every step. We design a single algorithm that, for every possible underlying distribution, obtains a $1-\epsilon$ fraction of the profit obtained by an algorithm that knows the entire request sequence ahead of time... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS