A Unified View of Online Matching and Resource Allocation Problems Whereas small regret online algorithms for applications as diverse network revenue management (NRM), assemble-to-order (ATO) systems, stochastic bin packing (SBP) are known in the literature, design existing tailored to specific application often use strategy resolving a planning linear program. In paper “Greedy Algorithm Multiw...

We analyze the orthogonal greedy algorithm when applied to dictionaries $\mathbb {D}$ whose convex hull has small entropy. show that if metric entropy of decays at a rate notation="LaTeX">$O\left({n^{-\frac {1}{2}-\alpha }}\right)$ fo...