A Simple and General Problem and its Optimal Randomized Online Algorithm Design with Competitive Analysis

TL;DR

This paper introduces a framework for designing optimal randomized online algorithms for a simple, general problem, with applications in unpredictable renewable energy microgrids, ensuring the best competitive ratio via Yao's Principle.

Contribution

It provides a tractable framework for randomized online algorithm design and proves optimality using Yao's Principle for a simple problem.

Findings

Framework achieves optimal competitive ratio.

Applicable to microgrid renewable energy management.

Simplifies online algorithm design process.

Abstract

The online algorithm design was proposed to handle the caching problem when the future information is unknown. And currently, it draws more and more attentions from the researchers from the areas of microgrid, where the production of renewables are unpredictable. In this note, we present a framework of randomized online algorithm design for the \textit{simple and tractable} problem. This framework hopes to provide a tractable design to design a randomized online algorithm, which can be proved to achieve the best competitive ratio by \textit{Yao's Principle}.