research
∙
12/24/2021
Robust Secretary and Prophet Algorithms for Packing Integer Programs
We study the problem of solving Packing Integer Programs (PIPs) in the o...
share
research
∙
04/15/2021
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing
The current best algorithms for convex body chasing problem in online al...
research
∙
05/28/2020
Dimension-Free Bounds on Chasing Convex Functions
We consider the problem of chasing convex functions, where functions arr...
research
∙
05/28/2019
Chasing Convex Bodies with Linear Competitive Ratio
We study the problem of chasing convex bodies online: given a sequence o...
research
∙
06/22/2018