4 papers · 1 filter
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
Adam Lechowicz, Nicolas Christianson, Bo Sun +4
We introduce and study spatiotemporal online allocation with deadline constraints (), a new online problem motivated by emerging challenges in sustainability and ene…
Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
Adam Lechowicz, Nicolas Christianson, Bo Sun +4
We introduce and study online conversion with switching costs, a family of online problems that capture emerging problems at the intersection of energy and sustainability. In this…
Chasing Convex Functions with Long-term Constraints
Adam Lechowicz, Nicolas Christianson, Bo Sun +4
We introduce and study a family of online metric problems with long-term constraints. In these problems, an online player makes decisions in a metric space t…
Risk-Sensitive Online Algorithms
Nicolas Christianson, Bo Sun, Steven Low +1
We study the design of risk-sensitive online algorithms, in which risk measures are used in the competitive analysis of randomized online algorithms. We introduce the CVaR-com…