Dynamic resource allocation: the geometry and robustness of constant regret

DOI10.1287/MOOR.2020.0334MaRDI QIDQ6893688zbMATH OpenFDO

Authors Alberto Vera, Alessandro Arlotto, Itai Gurvich, Eli Levin

Publication date 26 November 2025

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/MOOR.2020.0334

zbMATH Keywords

adaptive online policymultisecretary problemonline packingregret

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Linear programming (90C05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

This page was built for publication: Dynamic resource allocation: the geometry and robustness of constant regret

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6893688)