Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack

DOI10.1137/1.9781611977073.51MaRDI QIDQ6575124zbMATH OpenFDO

Authors Will Ma, Jiawei Zhang

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.51

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Simple and optimal online contention resolution schemes for k-uniform matroids
• Online contention resolution schemes for size-stochastic knapsacks
• Nonlinear optimal control of postprandial blood glucose response for patients with type 2 diabetes or prediabetes by meal order
• A bicriterion concentration inequality and prophet inequalities for k-fold matroid unions
• Constant approximation for network revenue management with Markovian-correlated customer arrivals
• Leveraging reusability: improved competitive ratio of greedy for reusable resources

This page was built for publication: Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack

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