The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems

DOI10.1287/opre.2021.2242arXiv2011.10124OpenAlexW3109308412MaRDI QIDQ6202662

Haihao Lu, Vahab S. Mirrokni, Santiago R. Balseiro

Publication date: 26 February 2024

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.10124

zbMATH Keywords

optimizationnonstationaritynonconvexityonline allocation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

This page was built for publication: The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems