Approachability with constraints
Résumé
We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we study 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. We provide a full characterization of these pairs when D is convex and open, and a sufficient condition when D is not convex.
Domaines
Economies et finances| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
