Approachability with Constraints
Not on the map. Why?
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 3 Dec 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.