Skip to Main content Skip to Navigation
Journal articles

Approachability with constraints

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Elisabeth Lhuillier <>
Submitted on : Thursday, February 11, 2021 - 11:17:51 AM
Last modification on : Monday, March 29, 2021 - 2:47:40 PM

Links full text




Gaëtan Fournier, Eden Kuperwasser, Orin Munk, Eilon Solan, Avishay Weinbaum. Approachability with constraints. European Journal of Operational Research, Elsevier, inPress, ⟨10.1016/j.ejor.2020.11.013⟩. ⟨hal-03138536⟩



Record views