Blackwell's 1956 approachability theorem is provably equivalent to no-regret learning (online linear optimization)

In 1956 David Blackwell asked what a player can guarantee in a repeated game whose payoffs are vector-valued rather than scalar, and proved his approachability theorem — a generalization of von Neumann's minimax theorem stating the conditions under which a player can force the long-run average payoff vector into a target convex set. For decades this read as an abstract corner of game theory.

Abernethy, Bartlett & Hazan (COLT 2011, Tier 1) showed it is load-bearing rather than curious: "Blackwell's result is equivalent to, in a very strong sense, the problem of regret minimization for Online Linear Optimization. We show that any algorithm for one such problem can be efficiently converted into an algorithm for the other." The equivalence runs both directions — an approachability strategy yields a no-regret algorithm and vice versa — and the paper uses it to derive, among other things, an efficient calibrated-forecasting algorithm.

The consequence is that the modern no-regret / online-learning toolkit — multiplicative weights (MWU), follow-the-regularized-leader (FTRL), online mirror descent — is Blackwell's 1956 framework in a different dress. The reduction also reaches applications: regret matching, the simplex minimizer inside counterfactual regret minimization, is itself an instance of the approachability game (claim-regret-matching-cfr-underpin-superhuman-poker-ai). The chip lineage named for Blackwell (claim-nvidia-blackwell-gpu-named-for-statistician-david-blackwell) thus runs, in part, on his own mathematics.

This is a rare well-connected seed in an area the vault otherwise leaves empty (online/game-theoretic learning); it is thematically adjacent to — but distinct from — the vault's backprop credit-assignment and geometry-of-optimization notes such as claim-amari-1998-natural-gradient-fisher-steepest-descent (both concern non-Euclidean update geometry, but approachability is about adversarial regret, not gradient descent).