# Approachability with Constraints

arXiv: https://arxiv.org/abs/1712.00781 · HTML: https://mlsanity.com/paper/1712.00781/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Dec 2017.

## Built on by (most cited first, 1 of 1)

- [Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction](https://mlsanity.com/paper/2602.17577/) (2026)

## Abstract (arXiv)

We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we characterize the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff converges to the set A, while the average payoff always remains in D.