Groups
Category
Online algorithms make decisions step by step without seeing the future and are judged against an all-knowing offline optimum.
The Minimax Theorem states that in zero-sum two-player games with suitable convexity and compactness, the best guaranteed payoff for the maximizer equals the worst-case loss for the minimizer.