Online Resource Allocation under Horizon Uncertainty-Reference-Cited by-同舟云学术

Online Resource Allocation under Horizon Uncertainty

Published:2023-06-19 Issue: Volume: Page:
ISSN:
Container-title:Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems
language:
Short-container-title:

Author:

Balseiro Santiago¹^ORCID,Kroer Christian¹^ORCID,Kumar Rachitesh¹^ORCID

Affiliation:

1. Columbia University, New York, NY, USA

Funder

National Science Foundation

Office of Naval Research

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3578338.3593559

Reference4 articles.

1. Predict and Match

2. Santiago Balseiro , Haihao Lu , and Vahab Mirrokni . 2020. The best of many worlds: Dual mirror descent for online allocation problems. arXiv preprint arXiv:2011.10124 ( 2020 ). Santiago Balseiro, Haihao Lu, and Vahab Mirrokni. 2020. The best of many worlds: Dual mirror descent for online allocation problems. arXiv preprint arXiv:2011.10124 (2020).

3. Brian Brubach , Nathaniel Grammel , Will Ma , and Aravind Srinivasan . 2019. Online Matching Frameworks under Stochastic Rewards , Product Ranking, and Unknown Patience. arXiv preprint arXiv:1907.03963 ( 2019 ). Brian Brubach, Nathaniel Grammel, Will Ma, and Aravind Srinivasan. 2019. Online Matching Frameworks under Stochastic Rewards, Product Ranking, and Unknown Patience. arXiv preprint arXiv:1907.03963 (2019).

4. Online Allocation with Traffic Spikes

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An online dynamic dual bin packing with lookahead approach for server-to-cell assignment in computer server industry;Computers & Industrial Engineering;2024-10

2. Online Allocation with Replenishable Budgets: Worst Case and Beyond;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2024-02-16