research-article

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

Authors:

Nikhil R. Devanur,

Kamal Jain,

Balasubramanian Sivan,

Christopher A. WilkensAuthors Info & Claims

Journal of the ACM (JACM), Volume 66, Issue 1

Article No.: 7, Pages 1 - 41

https://doi.org/10.1145/3284177

Published: 09 January 2019 Publication History

Get Access

Abstract

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−ϵ fraction of the profit obtained by an algorithm that knows the entire request sequence ahead of time. The factor ϵ approaches 0 when no single request consumes/contributes a significant fraction of the global consumption/contribution by all requests together. We show that the tradeoff we obtain here that determines how fast ϵ approaches 0, is near optimal: We give a nearly matching lower bound showing that the tradeoff cannot be improved much beyond what we obtain.

Going beyond the model of a static underlying distribution, we introduce the adversarial stochastic input model, where an adversary, possibly in an adaptive manner, controls the distributions from which the requests are drawn at each step. Placing no restriction on the adversary, we design an algorithm that obtains a 1−ϵ fraction of the optimal profit obtainable w.r.t. the worst distribution in the adversarial sequence. Further, if the algorithm is given one number per distribution, namely the optimal profit possible for each of the adversary’s distribution, then we design an algorithm that achieves a 1−ϵ fraction of the weighted average of the optimal profit of each distribution the adversary picks.

In the offline setting we give a fast algorithm to solve very large linear programs (LPs) with both packing and covering constraints. We give algorithms to approximately solve (within a factor of 1+ϵ) the mixed packing-covering problem with O(γ m log (n/δ)/ϵ²) oracle calls where the constraint matrix of this LP has dimension n× m, the success probability of the algorithm is 1−δ, and γ quantifies how significant a single request is when compared to the sum total of all requests.

We discuss implications of our results to several special cases including online combinatorial auctions, network routing, and the adwords problem.

References

[1]

Shipra Agrawal and Nikhil R. Devanur. 2015. Fast algorithms for online stochastic convex programming. In Proceedings of the Symposium on Discrete Algorithms (SODA’15).

Abstract

References

Cited By

Index Terms

Recommendations

Near optimal online algorithms and fast approximation algorithms for resource allocation problems

Online algorithms for market clearing

Near-Optimal Online Resource Allocation in the Random-Order Model

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations