A Primal Condition for Approachability with Partial Monitoring
Shie Mannor (EE-Technion), Vianney Perchet (LPMA), Gilles Stoltz, (INRIA Paris - Rocquencourt, DMA, GREGH)

TL;DR
This paper establishes primal conditions for approachability in games with partial monitoring, generalizing classical results and enabling strategies based on modified payoff functions rather than signal estimation.
Contribution
It introduces primal conditions for approachability under partial monitoring, using modified reward functions and projection-based strategies, expanding applicability to arbitrary signaling and convex sets.
Findings
Provides primal approachability conditions with partial monitoring
Develops strategies based on modified payoff functions and projections
Generalizes classical approachability results to broader settings
Abstract
In approachability with full monitoring there are two types of conditions that are known to be equivalent for convex sets: a primal and a dual condition. The primal one is of the form: a set C is approachable if and only all containing half-spaces are approachable in the one-shot game; while the dual one is of the form: a convex set C is approachable if and only if it intersects all payoff sets of a certain form. We consider approachability in games with partial monitoring. In previous works (Perchet 2011; Mannor et al. 2011) we provided a dual characterization of approachable convex sets; we also exhibited efficient strategies in the case where C is a polytope. In this paper we provide primal conditions on a convex set to be approachable with partial monitoring. They depend on a modified reward function and lead to approachability strategies, based on modified payoff functions, that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Advanced Bandit Algorithms Research · Reinforcement Learning in Robotics
