How the experts algorithm can help solve LPs online

DOI10.1287/MOOR.2016.0782MaRDI QIDQ6828837zbMATH OpenFDO

Authors Anupam Gupta, Marco Molinaro

Publication date 16 November 2016

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

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

zbMATH Keywords

experts algorithmlinear programmingonline algorithmssecretary problem

Mathematics Subject Classification ID

Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Linear programming (90C05)

Cited in

(4)

• Knapsack secretary with bursty adversary
• The average-value allocation problem
• Configuration balancing for stochastic requests
• New concentration bounds and their applications in online resource allocation

This page was built for publication: How the experts algorithm can help solve LPs online

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