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

@inproceedings{Devanur2011NearOO,
  title={Near optimal online algorithms and fast approximation algorithms for resource allocation problems},
  author={Nikhil R. Devanur and Kamal Jain and Balasubramanian Sivan and Christopher A. Wilkens},
  booktitle={EC},
  year={2011}
}
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains many interesting special cases such as the Adwords problem. In the online setting we introduce a new distributional model called the adversarial stochastic input model, which is a generalization of the i.i.d model with unknown distributions, where the distributions can change over time. In this model we give a 1-O… CONTINUE READING
Highly Cited
This paper has 131 citations. REVIEW CITATIONS

Topics

Statistics

0102020112012201320142015201620172018
Citations per Year

131 Citations

Semantic Scholar estimates that this publication has 131 citations based on the available data.

See our FAQ for additional information.