Approachability with Discounting

We establish a version of Blackwell’s (1956) approachability result with discounting. Our main result shows that, for convex sets, our notion of approachability with discounting is equivalent to Blackwell’s (1956) approachability. Our proofs are based on a concentration result for probability measures and on the minmax theorem for two-person, zero-sum games.