The DOI matches its Crossref record.
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Abstract
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(ε) approximation algorithm for the resource allocation problem, with almost the weakest possible assumption: the ratio of the maximum amount of resource consumed by any single request to the total capacity of the resource, and the ratio of the profit contributed by any single request to the optimal profit is at most (ε2/log(1/ε)2)/(log n + log (1/ε)) where n is the number of resources available. There are instances where this ratio is #949;2/log n such that no randomized algorithm can have a competitive ratio of 1-o(ε) even in the i.i.d model. The upper bound on ratio that we require improves on the previous upper-bound for the i.i.d case by a factor of n.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Online Task Assignment in Crowdsourcing Markets
Ho, C.-J., & Vaughan, J. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8120 · Cited by 293
Online Display Advertising Markets: A Literature Review and Future Directions
Choi, H., Mela, C. F., Balseiro, S. R., & Leary, A. (2020) · Information Systems Research · doi:10.1287/isre.2019.0902 · Cited by 181
Metadata
- Authors
- Devanur, N. R., Jain, K., Sivan, B., & Wilkens, C. A.
- Venue
- Proceedings of the 12th ACM conference on Electronic commerce
- Publisher
- ACM
- Published
- 2011-06-05
- Pages
- 29-38
- OpenAlex
- W2070546659
- Cited by
- 160
- References
- 0
- FWCI
- 13.42
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. https://app.cochat.ai/papers/10.1145/1993574.1993581
- The paper
- Devanur, N. R., Jain, K., Sivan, B., & Wilkens, C. A. (2011). Near optimal online algorithms and fast approximation algorithms for resource allocation problems. Proceedings of the 12th ACM conference on Electronic commerce. https://doi.org/10.1145/1993574.1993581
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.