Distributed online optimization and online games have been increasingly researched in the
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …

Existing approaches to online convex optimization make sequential one-slot-ahead
decisions, which lead to (possibly adversarial) losses that drive subsequent decision …

We propose a distributed algorithm for online energy management in networked microgrids
with a high penetration of distributed energy resources (DERs). A high penetration of DERs …

This paper studies the online optimal control problem with time-varying convex stage costs
for a time-invariant linear dynamical system, where a finite lookahead window of accurate …

We study\emph {smoothed online convex optimization}, a version of online convex
optimization where the learner incurs a penalty for changing her actions between rounds …

This article considers online optimization with a finite prediction window of cost functions
and additional switching costs on the decisions. We study the fundamental limits of dynamic …

We consider online convex optimization (OCO) problems with switching costs and noisy
predictions. While the design of online algorithms for OCO problems has received …

Making use of predictions is a crucial, but under-explored, area of online algorithms. This
paper studies a class of online optimization problems where we have external noisy …

This paper presents competitive algorithms for a novel class of online optimization problems
with memory. We consider a setting where the learner seeks to minimize the sum of a hitting …

We study an online caching problem in which requests can be served by a local cache to
avoid retrieval costs from a remote server. The cache can update its state after a batch of …