Conference paper · 2024 · Open access
Approximating Optimum Online for Capacitated Resource Allocation
ACM Conference on Economics and Computation (EC), 278 · Published 8 July 2024 · DOI 10.1145/3670865.3673471
In brief
“Approximating Optimum Online for Capacitated Resource Allocation” is a 2024 conference paper by Alexander Braun and 3 co-authors, published in ACM Conference on Economics and Computation (EC). OpenAlex counts 9 citations as of 19 November 2026. It is open access: the full text is free to read at ACM Conference on Economics and Computation (EC).
- Citations
- 9
- Most cited in
- 2026 (6)
- Authors
- 4
Abstract
We study online capacitated resource allocation, a natural generalization of online stochastic max-weight bipartite matching. This problem is motivated by ride-sharing and Internet advertising applications, where online arrivals may have the capacity to serve multiple offline users.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Braun, A., Keßelheim, T., Pollner, T., & Saberi, A. (2024). Approximating Optimum Online for Capacitated Resource Allocation. ACM Conference on Economics and Computation (EC), 278. https://doi.org/10.1145/3670865.3673471
MLA 9
Braun, Alexander, et al. “Approximating Optimum Online for Capacitated Resource Allocation.” ACM Conference on Economics and Computation (EC), 2024, p. 278. https://doi.org/10.1145/3670865.3673471.
Chicago
Braun, Alexander, Thomas Keßelheim, Tristan Pollner, and Amin Saberi. 2024. “Approximating Optimum Online for Capacitated Resource Allocation.” ACM Conference on Economics and Computation (EC): 278. https://doi.org/10.1145/3670865.3673471.
Harvard
Braun, A. et al. (2024) ‘Approximating Optimum Online for Capacitated Resource Allocation’, ACM Conference on Economics and Computation (EC), p. 278. doi:10.1145/3670865.3673471.
IEEE
A. Braun, T. Keßelheim, T. Pollner, and A. Saberi, “Approximating Optimum Online for Capacitated Resource Allocation,” ACM Conference on Economics and Computation (EC), p. 278, 2024, doi: 10.1145/3670865.3673471.
BibTeX
@inproceedings{braun2024approximating,
title = {{Approximating Optimum Online for Capacitated Resource Allocation}},
author = {Braun, Alexander and Keßelheim, Thomas and Pollner, Tristan and Saberi, Amin},
booktitle = {ACM Conference on Economics and Computation (EC)},
year = {2024},
pages = {278},
doi = {10.1145/3670865.3673471},
url = {https://doi.org/10.1145/3670865.3673471}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 2 | |
| 2025 | 1 | |
| 2026 | 6 |
Topic and keywords
Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- approximation algorithms
- ride-sharing
- online advertising
- online matching
- capacity constraints
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Braun, A., Keßelheim, T., Pollner, T., & Saberi, A. (2024). Approximating Optimum Online for Capacitated Resource Allocation. ACM Conference on Economics and Computation (EC), 278. https://doi.org/10.1145/3670865.3673471
How many times has this paper been cited?
9 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at ACM Conference on Economics and Computation (EC): sign in and open the PDF from this page.
Who wrote this paper?
Alexander Braun, Thomas Keßelheim, Tristan Pollner, Amin Saberi.
What is the DOI of this paper?
10.1145/3670865.3673471, permanently at https://doi.org/10.1145/3670865.3673471. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.