22 citations · 93 across the 17 of their papers we have counts for
7 papers · 1 filter
Peak-Aware One-Way Trading: Competitive and Learning-Augmented Algorithms for Energy Procurement
Jackson Bibbens, Adam Lechowicz, Nicolas Christianson +2
We introduce peak-aware one-way trading (), an online problem in which a player must purchase a fixed quantity of an asset by a deadline, minimizing its total cost…
Online Smoothed Demand Management
Adam Lechowicz, Nicolas Christianson, Mohammad Hajiesmaili +2
We introduce and study a class of online problems called online smoothed demand management , motivated by paradigm shifts in grid integration and energy storage fo…
Signal-Aware Workload Shifting Algorithms with Uncertainty-Quantified Predictors
Ezra Johnson, Adam Lechowicz, Mohammad Hajiesmaili
A wide range of sustainability and grid-integration strategies depend on workload shifting, which aligns the timing of energy consumption with external signals such as grid curtail…
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…
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…
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…
The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
Adam Lechowicz, Nicolas Christianson, Jinhang Zuo +4
We introduce and study the online pause and resume problem. In this problem, a player attempts to find the lowest (alternatively, highest) prices in a sequence of fixed length…